Qubit-efficient entanglement spectroscopy using qubit resets

Abstract

One strategy to fit larger problems on NISQ devices is to exploit a tradeoff between circuit width and circuit depth. Unfortunately, this tradeoff still limits the size of tractable problems since the increased depth is often not realizable before noise dominates. Here, we develop qubit-efficient quantum algorithms for entanglement spectroscopy which avoid this tradeoff. In particular, we develop algorithms for computing the trace of the n-th power of the density operator of a quantum system, $Tr({\rho }^n)$, (related to the Rényi entropy of order n) that use fewer qubits than any previous efficient algorithm while achieving similar performance in the presence of noise, thus enabling spectroscopy of larger quantum systems on NISQ devices. Our algorithms, which require a number of qubits independent of n, are variants of previous algorithms with width proportional to n, an asymptotic difference. The crucial ingredient in these new algorithms is the ability to measure and reinitialize subsets of qubits in the course of the computation, allowing us to reuse qubits and increase the circuit depth without suffering the usual noisy consequences. We also introduce the notion of effective circuit depth as a generalization of standard circuit depth suitable for circuits with qubit resets. This tool helps explain the noise-resilience of our qubit-efficient algorithms and should aid in designing future algorithms. We perform numerical simulations to compare our algorithms to the original variants and show they perform similarly when subjected to noise. Additionally, we experimentally implement one of our qubit-efficient algorithms on the Honeywell System Model H0, estimating $Tr({\rho }^n)$ for larger n than possible with previous algorithms.

arXiv comment16 pages, 13 figures. Expanded introduction and conclusion and other minor corrections (thank you to anonymous referees). Reformatted with the Quantum LaTeX class

References in corpus (42)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• The theory of variational hybrid quantum-classical algorithms
• A Quantum Approximate Optimization Algorithm
• Entanglement Spectrum as a Generalization of Entanglement Entropy: Identification of Topological Order in Non-Abelian Fractional Quantum Hall Effect States
• Quantum principal component analysis
• Error mitigation for short-depth quantum circuits
• Quantum fingerprinting
• Measuring entanglement entropy through the interference of quantum many-body twins
• Efficient variational quantum simulator incorporating active error minimisation
• Demonstration of the trapped-ion quantum-CCD computer architecture
• Hybrid quantum-classical algorithms and quantum error mitigation
• Entanglement spectrum in one-dimensional systems
• Entanglement spectrum of topological insulators and superconductors
• Towards Quantum Machine Learning with Tensor Networks
• Bipartite Fluctuations as a Probe of Many-Body Entanglement
• Entanglement Spectrum of a Disordered Topological Chern Insulator
• Fast Reset and Suppressing Spontaneous Emission of a Superconducting Qubit
• Simulating Large Quantum Circuits on a Small Quantum Computer
• Learning the quantum algorithm for state overlap
• Low-cost error mitigation by symmetry verification
• Demonstrating a Driven Reset Protocol of a Superconducting Qubit
• Fast and Unconditional All-Microwave Reset of a Superconducting Qubit
• The SWAP test and the Hong-Ou-Mandel effect are equivalent
• Challenges and Opportunities of Near-Term Quantum Computing Systems
• Variational Quantum Eigensolver with Fewer Qubits
• Entanglement Spectrum, Critical Exponents and Order Parameters in Quantum Spin Chains
• Analog quantum chemistry simulation
• A geometric proof of the equality between entanglement and edge spectra
• Quantum Simulation and Spectroscopy of Entanglement Hamiltonians
• Entanglement Hamiltonian Tomography in Quantum Simulation
• Parallelizing Quantum Circuits
• Measuring the Renyi entropy of a two-site Fermi-Hubbard model on a trapped ion quantum computer
• Rapid Driven Reset of a Qubit Readout Resonator
• Holographic quantum algorithms for simulating correlated spin systems
• Entanglement spectroscopy on a quantum computer
• Pulsed reset protocol for fixed-frequency superconducting qubits
• The controlled SWAP test for determining quantum entanglement
• Entanglement spectroscopy with a depth-two quantum circuit
• Recycling qubits in near-term quantum computers
• Entanglement in topological systems

Cited by in corpus (18)

• Quantum Simulation for High Energy Physics
• Quantum circuits for measuring weak values, Kirkwood--Dirac quasiprobability distributions, and state spectra
• Quantum algorithms for estimating quantum entropies
• Entanglement from tensor networks on a trapped-ion QCCD quantum computer
• Multivariate trace estimation in constant quantum depth
• Quantum Phase Processing and its Applications in Estimating Phase and Entropies
• Variational quantum Gibbs state preparation with a truncated Taylor series
• A tensor network discriminator architecture for classification of quantum data on quantum computers
• Unified multivariate trace estimation and quantum error mitigation
• Ancilla-free continuous-variable SWAP test
• Qubit-efficient exponential suppression of errors
• Symmetry protected entanglement in random mixed states
• Readout Error Mitigation for Mid-Circuit Measurements and Feedforward
• Parallel Quantum Signal Processing Via Polynomial Factorization
• Quantum Generative Training Using Rényi Divergences
• Quantum tensor network algorithms for evaluation of spectral functions on quantum computers
• Resource-efficient algorithm for estimating the trace of quantum state powers
• Explicit Formulas for Estimating Trace of Reduced Density Matrix Powers via Single-Circuit Measurement Probabilities