Shallow quantum circuit for generating extremely low-entangled approximate state designs

Abstract

Random quantum states have various applications in quantum information science. We discover a new ensemble of quantum states that serve as an $\epsilon$-approximate state $t$-design while possessing extremely low entanglement, magic, and coherence. These resources can reach their theoretical lower bounds, $\Omega (\log (t/\epsilon ))$, which are also proven in this work. This implies that for fixed $t$ and $\epsilon$, entanglement, magic, and coherence do not scale with the system size, i.e., $O(1)$ with respect to the total number of qubits $n$. Moreover, we explicitly construct an ancilla-free shallow quantum circuit for generating such states by transforming $k$-qubit approximate state designs into $n$-qubit ones without increasing the support size. The depth of such a quantum circuit, $O(t[\log t{]}^3\log n\log (1/\epsilon ))$, is the most efficient among existing algorithms without ancilla qubits. A class of quantum circuits proposed in our work offers reduced cost for classical simulation of random quantum states, leading to potential applications in quantum information processing. As a concrete example, we propose classical shadow tomography using an estimator with superpositions between only two states, from which almost all quantum states can be efficiently certified by requiring only $O(1)$ measurements and classical post-processing time.

7 pages, 2 figures, 1 table + 33-page supplementary information

References in corpus (31)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• The density-matrix renormalization group in the age of matrix product states
• Quantifying Coherence
• Characterizing Quantum Supremacy in Near-Term Devices
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Logical quantum processor based on reconfigurable atom arrays
• Randomized Benchmarking of Quantum Gates
• A simple formula for the average gate fidelity of a quantum dynamical operation
• High-fidelity parallel entangling gates on a neutral atom quantum computer
• The randomized measurement toolbox
• Aspects of generic entanglement
• Local random quantum circuits are approximate polynomial-designs
• Stabilizer Rényi entropy
• Simulation of quantum circuits by low-rank stabilizer decompositions
• Achieving quantum supremacy with sparse and noisy commuting quantum computations
• A general framework for randomized benchmarking
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• Exact emergent quantum state designs from quantum chaotic dynamics
• Disentangling Scrambling and Decoherence via Quantum Teleportation
• Convergence Conditions for Random Quantum Circuits
• Random quantum circuits are approximate unitary $t$-designs in depth $O\left(n{t}^{5+o(1)}\right)$
• A Random Unitary Circuit Model for Black Hole Evaporation
• Efficient quantum algorithms for stabilizer entropies
• Pseudomagic Quantum States
• Pseudorandom unitaries are neither real nor sparse nor noise-robust
• Polylogarithmic-depth controlled-NOT gates without ancilla qubits
• Dynamics of Pseudoentanglement
• High-fidelity and robust controlled-Z gates implemented with Rydberg atoms via echoing rapid adiabatic passage
• Holographic deep thermalization for secure and efficient quantum random state generation
• Saturation and recurrence of quantum complexity in random local quantum dynamics
• Fast pseudorandom quantum state generators via inflationary quantum gates