Measurement-induced entanglement and complexity in random constant-depth 2D quantum circuits

• URL: http://arxiv.org/abs/2410.23248v1
• Date: Wed, 30 Oct 2024 17:33:02 GMT
• Title: Measurement-induced entanglement and complexity in random constant-depth 2D quantum circuits
• Authors: Max McGinley, Wen Wei Ho, Daniel Malz,
• Abstract summary: We analyse the entanglement structure of states generated by random constant-depth quantum circuits. We prove that macroscopic long-ranged entanglement is generated above some constant critical depth in several natural classes of circuit architectures.
• Score: 0.0
• License:
• Abstract: We analyse the entanglement structure of states generated by random constant-depth two-dimensional quantum circuits, followed by projective measurements of a subset of sites. By deriving a rigorous lower bound on the average entanglement entropy of such post-measurement states, we prove that macroscopic long-ranged entanglement is generated above some constant critical depth in several natural classes of circuit architectures, which include brickwork circuits and random holographic tensor networks. This behaviour had been conjectured based on previous works, which utilize non-rigorous methods such as replica theory calculations, or work in regimes where the local Hilbert space dimension grows with system size. To establish our lower bound, we develop new replica-free theoretical techniques that leverage tools from multi-user quantum information theory, which are of independent interest, allowing us to map the problem onto a statistical mechanics model of self-avoiding walks without requiring large local Hilbert space dimension. Our findings have consequences for the complexity of classically simulating sampling from random shallow circuits, and of contracting tensor networks: First, we show that standard algorithms based on matrix product states which are used for both these tasks will fail above some constant depth and bond dimension, respectively. In addition, we also prove that these random constant-depth quantum circuits cannot be simulated by any classical circuit of sublogarithmic depth.

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)
• Dynamical simulations of many-body quantum chaos on a quantum computer [3.731709137507907]
  We study a class of maximally chaotic circuits known as dual unitary circuits. We show that a superconducting quantum processor with 91 qubits is able to accurately simulate these correlators. We then probe dynamics beyond exact verification, by perturbing the circuits away from the dual unitary point.
  arXiv  Detail & Related papers  (2024-11-01T17:57:13Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Gaussian initializations help deep variational quantum circuits escape from the barren plateau [87.04438831673063]
  Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years. However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number. This result leads to a general belief that deep quantum circuits will not be feasible for practical tasks.
  arXiv  Detail & Related papers  (2022-03-17T15:06:40Z)
• Neural-Network Quantum States for Periodic Systems in Continuous Space [66.03977113919439]
  We introduce a family of neural quantum states for the simulation of strongly interacting systems in the presence of periodicity. For one-dimensional systems we find very precise estimations of the ground-state energies and the radial distribution functions of the particles. In two dimensions we obtain good estimations of the ground-state energies, comparable to results obtained from more conventional methods.
  arXiv  Detail & Related papers  (2021-12-22T15:27:30Z)
• Quantum simulation using noisy unitary circuits and measurements [0.0]
  Noisy quantum circuits have become an important cornerstone of our understanding of quantum many-body dynamics. We give an overview of two classes of dynamics studied using random-circuit models, with a particular focus on the dynamics of quantum entanglement. We consider random-circuit sampling experiments and discuss the usefulness of random quantum states for simulating quantum many-body dynamics on NISQ devices.
  arXiv  Detail & Related papers  (2021-12-13T14:00:06Z)
• Decoding the Entanglement Structure of Monitored Quantum Circuits [0.0]
  We find that the entanglement structure of a monitored quantum circuit in the volume-law phase is largely independent of the initial states. We derive a general relation between the code distance and the sub-leading contribution to the volume-law entanglement entropy.
  arXiv  Detail & Related papers  (2021-09-17T18:00:00Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Nonadiabatic geometric quantum gates that are insensitive to qubit-frequency drifts [8.750801670077806]
  In the current implementation of nonadiabatic geometric phases, operational and/or random errors tend to destruct the conditions that induce geometric phases. Here, we apply the path-design strategy to explain in detail why both configurations can realize universal quantum gates in a single-loop way. Our scheme provides a promising way towards practical realization of high-fidelity and robust nonadiabatic geometric quantum gates.
  arXiv  Detail & Related papers  (2021-03-16T12:05:45Z)
• 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.