Readout errors limit how far adaptive quantum circuits can entangle
Chenfeng Cao, Ruge Lin
Abstract
Measurement and feedforward let quantum circuits entangle arbitrarily distant qubits in constant depth if measurement records are perfect and classical communication is instantaneous. We allow each reported bit to flip independently with a fixed probability between zero and one half, keeping all gates ideal. Consider a square-lattice device with a unique path between the endpoints and a bounded number of qubits per site. Beyond [O(D3)] steps along that path, every depth-D circuit starting from a product state leaves the endpoints exactly separable in every record, however rare. By copying outcomes onto spare qubits beside the path before readout, we attain a reach of [Θ(D3)] for a nondestructive parity measurement at fixed accuracy without postselection. On a one-dimensional chain, the optimal reach for the same measurement is [Θ(D2)]. On any interaction graph, a constant-depth circuit starting from a product state needs Ω(L L) qubits to entangle endpoints at graph distance L. The reliability of local readout thus limits the depth advantage of adaptive circuits for long-range entanglement.
Create a lesson
Related papers
High-temperature Gibbs states are uniformly Markovian and trivial
Andrew D. Kim, Tai Hsuan Yang, Jong Yeon Lee
Query-Optimal Quantum Minimum Finding from Numerical Estimators
Egil Bae
Fast, in-place, and ancilla-free quantum algorithms for integer multiplication and inversion
David Halpenny, Adithya Sireesh, Petros Wallden
High-Accuracy Neural-Network Quantum States via Randomized Real-Time Dynamics
John M. Martyn, Rod Rofougaran, Samuel Stein et al.
End-to-End Quantum Algorithm for Differential Equations: Application to Simulating a Biomolecular System
Mohsen Bagherimehrab, Daniyaal Farooqi, Gavin K. Brennen et al.
Classically Trained Quantum Generative Models with Shared Training and Fine Tuning for Quantum Matter
Mario Herrero-Gonzalez, Elham Kashefi, Mina Doosti