Recycling qubits in near-term quantum computers

Abstract

Quantum computers are capable of efficiently contracting unitary tensor networks, a task that is likely to remain difficult for classical computers. For instance, networks based on matrix product states or the multi-scale entanglement renormalization ansatz (MERA) can be contracted on a small quantum computer to aid the simulation of a large quantum system. However, without the ability to selectively reset qubits, the associated spatial cost can be exorbitant. In this paper, we propose a protocol that can unitarily reset qubits when the circuit has a common convolutional form, thus dramatically reducing the spatial cost for implementing the contraction algorithm on general near-term quantum computers. This protocol generates fresh qubits from used ones by partially applying the time-reversed quantum circuit over qubits that are no longer in use. In the absence of noise, we prove that the state of a subset of these qubits becomes $|0\dots 0⟩$, up to an error exponentially small in the number of gates applied. We also provide a numerical evidence that the protocol works in the presence of noise. We also provide a numerical evidence that the protocol works in the presence of noise, and formulate a condition under which the noise-resilience follows rigorously.

arXiv comment7+4 pages, 9 figures. Corollary A.2 fixed. Also, the mathematical statement about noise-resilience is added

References in corpus (17)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A variational eigenvalue solver on a quantum processor
• Barren plateaus in quantum neural network training landscapes
• Quantum Convolutional Neural Networks
• Entanglement renormalization
• Randomized Benchmarking of Quantum Gates
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Towards Practical Quantum Variational Algorithms
• Scalable Noise Estimation with Random Unitary Operators
• Sequential generation of entangled multi-qubit states
• Algorithms for entanglement renormalization
• TensorNetwork: A Library for Physics and Machine Learning
• Rigorous free fermion entanglement renormalization from wavelet theory
• Holographic quantum simulation
• Noise-robust exploration of many-body quantum states on near-term quantum devices
• Adiabatic ground state preparation in an expanding lattice

Cited by in corpus (6)

• Quantum technologies need a Quantum Energy Initiative
• Qubit-efficient entanglement spectroscopy using qubit resets
• Preparing Renormalization Group Fixed Points on NISQ Hardware
• Classification of same-gate quantum circuits and their space-time symmetries with application to the level-spacing distribution
• Image Classification by Throwing Quantum Kitchen Sinks at Tensor Networks
• Qubit recycling and the path counting problem