REVIEW 1 cited by
Exact convergence times for generation of random bipartite entanglement
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We calculate exact convergence times to reach random bipartite entanglement for various random protocols. The eigenproblem of a Markovian chain governing the process is mapped to a spin chain, thereby obtaining exact expression for the gap of the Markov chain for any number of qubits. For protocols coupling nearest neighbor qubits and CNOT gate the mapping goes to XYZ model while for U(4) gate it goes to an integrable XY model. For coupling between a random pair of qubits the mapping is to an integrable Lipkin-Meshkov-Glick model. In all cases the gap scales inversely with the number of qubits, thereby improving on a recent bound in [Phys.Rev.Lett. 98, 130502 (2007)].
Forward citations
Cited by 1 Pith paper
-
Emergence of Krylov complexity through quantum walks: An exploration of the quantum origins of complexity
Reducing a graph walk to distance-layers reproduces Krylov/spread complexity, yielding analytic finite-q SYK Lanczos coefficients and hypercube complexity D sin²(t/D), with faster saturation than classical-walk circuits.
Discussion (0). Continue with ORCID to comment.