Fastest local entanglement scrambler, multistage thermalization, and a
non-Hermitian phantom
- URL: http://arxiv.org/abs/2101.05579v2
- Date: Wed, 21 Apr 2021 11:03:00 GMT
- Title: Fastest local entanglement scrambler, multistage thermalization, and a
non-Hermitian phantom
- Authors: Jas Bensa and Marko Znidaric
- Abstract summary: We study random quantum circuits and their rate of producing bipartite entanglement.
The problem is mapped to a Markovian process and proved that there are large spectral equivalence classes.
We numerically demonstrate that the phenomenon occurs also in random circuits with non-optimal generic gates.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: We study random quantum circuits and their rate of producing bipartite
entanglement, specifically with respect to the choice of 2-qubit gates and the
order (protocol) in which these are applied. The problem is mapped to a
Markovian process and proved that there are large spectral equivalence classes
-- different configurations have the same spectrum. Optimal gates and the
protocol that generate entanglement with the fastest theoretically possible
rate are identified. Relaxation towards the asymptotic thermal entanglement
proceeds via a series of phase transitions in the local relaxation rate, which
is a consequence of non-Hermiticity. In particular, non-Hermiticity can cause
the rate to be either faster, or, even more interestingly, slower than
predicted by the matrix eigenvalue gap. This is caused by an exponential in
system size explosion of expansion coefficient sizes resulting in a 'phantom'
eigenvalue, and is due to non-orthogonality of non-Hermitian eigenvectors. We
numerically demonstrate that the phenomenon occurs also in random circuits with
non-optimal generic gates, random U(4) gates, and also without spatial or
temporal randomness, suggesting that it could be of wide importance also in
other non-Hermitian settings, including correlations.
Related papers
- Efficient quantum pseudorandomness under conservation laws [4.8120624300714665]
Local unitary designs capture statistical notions of quantum pseudorandomness.
In particular, the question of whether any local symmetric circuit can generate 2-designs efficiently remains open.
We explicitly construct local symmetric quantum circuits which converge to symmetric unitary 2-designs in time.
arXiv Detail & Related papers (2024-11-07T17:32:04Z) - Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.
We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.
We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
arXiv Detail & Related papers (2024-05-03T17:32:55Z) - Arbitrary relaxation rate under non-Hermitian matrix iterations [0.0]
We study the exponential relaxation of observables propagated with a non-Hermitian transfer matrix.
We show that the decay rate can be an arbitrary value between the second largest eigenvalue and the largest value in the pseudospectrum.
arXiv Detail & Related papers (2023-12-22T11:18:35Z) - Quantum information spreading in generalised dual-unitary circuits [44.99833362998488]
We show that local operators spread at the speed of light as in dual-unitary circuits.
We use these properties to find a closed-form expression for the entanglement membrane in these circuits.
arXiv Detail & Related papers (2023-12-05T18:09:27Z) - Real-time dynamics of false vacuum decay [49.1574468325115]
We investigate false vacuum decay of a relativistic scalar field in the metastable minimum of an asymmetric double-well potential.
We employ the non-perturbative framework of the two-particle irreducible (2PI) quantum effective action at next-to-leading order in a large-N expansion.
arXiv Detail & Related papers (2023-10-06T12:44:48Z) - Measurement phase transitions in the no-click limit as quantum phase
transitions of a non-hermitean vacuum [77.34726150561087]
We study phase transitions occurring in the stationary state of the dynamics of integrable many-body non-Hermitian Hamiltonians.
We observe that the entanglement phase transitions occurring in the stationary state have the same nature as that occurring in the vacuum of the non-hermitian Hamiltonian.
arXiv Detail & Related papers (2023-01-18T09:26:02Z) - Dual unitary circuits in random geometries [0.0]
We show that regularity of the lattice circuit is not crucial for exact solvability.
We consider a circuit where random 2-qubit dual unitary gates sit at intersections of random arrangements straight lines in two dimensions.
arXiv Detail & Related papers (2022-06-20T09:11:43Z) - Random quantum circuits anti-concentrate in log depth [118.18170052022323]
We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated.
Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform.
In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
arXiv Detail & Related papers (2020-11-24T18:44:57Z) - Multi-time correlations in the positive-P, Q, and doubled phase-space
representations [0.0]
It is shown that expressions for time-ordered normal-ordered quantum observables in the positive-P distribution replace Heisenberg operators with the bare time-dependent variables.
The theory of multi-time observables in phase-space representations is extended, allowing non-perturbative treatment of many cases.
arXiv Detail & Related papers (2020-11-19T21:17:31Z) - How quantum evolution with memory is generated in a time-local way [0.0]
Two approaches to dynamics of open quantum systems are Nakajima-Zwanzig and time-convolutionless quantum master equation.
We show that the two are connected by a simple yet general fixed-point relation.
This allows one to extract nontrivial relations between the two.
arXiv Detail & Related papers (2020-02-17T20:10:49Z) - Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
Random quantum circuits are commonly viewed as hard to simulate classically.
We show that approximate simulation of typical instances is almost as hard as exact simulation.
We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
arXiv Detail & Related papers (2019-12-31T19:00:00Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.