Asymptotically Optimal Circuit Depth for Quantum State Preparation and General Unitary Synthesis

Abstract

The Quantum State Preparation problem aims to prepare an $n$-qubit quantum state $|{\psi }_v⟩={\sum }_{k=0}^{2^n-1}{v}_k|k⟩$ from the initial state $|0{⟩}^{\otimes n}$, for a given unit vector $v=(v_0,v_1,v_2,\dots ,v_{2^n-1}{)}^T\in {\mathbb{C}}^{2^n}$ with $\Vert v{\Vert }_2=1$. The problem is of fundamental importance in quantum algorithm design, Hamiltonian simulation and quantum machine learning, yet its circuit depth and size complexity remain open when ancillary qubits are available. In this paper, we study efficient constructions of quantum circuits with $m$ ancillary qubits that can prepare $|{\psi }_v⟩$ in depth $\tilde{O}\left(\frac{2^n}{m+n}+n\right)$and size $O(2^n)$, achieving the optimal value for both measures simultaneously. These results also imply a depth complexity of $\Theta (4^n/(m+n))$ for quantum circuits implementing a general $n$-qubit unitary using $m=O(2^n/n)$ ancillary qubits. This resolves the depth complexity for circuits without ancillary qubits, and for circuits with exponentially many ancillary qubits, this gives a quadratic saving from $O(4^n)$ to $\tilde{\Theta }(2^n)$. Our circuits are deterministic, prepare the state and carry out the unitary precisely, utilize the ancillary qubits tightly and the depths are optimal in a wide range of parameter regime. The results can be viewed as (optimal) time-space tradeoff bounds, which is not only theoretically interesting, but also practically relevant in the current trend that the number of qubits starts to take off, by showing a way to use a large number of qubits to compensate the short qubit lifetime.

References in corpus (23)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum Machine Learning
• Elementary gates for quantum computation
• Quantum algorithm for solving linear systems of equations
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Quantum principal component analysis
• State preservation by repetitive error detection in a superconducting quantum circuit
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Synthesis of Quantum Logic Circuits
• Hamiltonian simulation with nearly optimal dependence on all parameters
• Creating superpositions that correspond to efficiently integrable probability distributions
• A quantum linear system algorithm for dense matrices
• A divide-and-conquer algorithm for quantum state preparation
• Quantum circuits with uniformly controlled one-qubit gates
• Quantum singular value decomposition of non-sparse low-rank matrices
• Approximation by Quantum Circuits
• Decompositions of general quantum gates
• Trading T gates for dirty qubits in state preparation and unitary synthesis
• Quantum Spectral Clustering
• Quantum linear systems algorithms: a primer
• Quantum Circuit Depth Lower Bounds For Homological Codes
• Low-depth Quantum State Preparation

Cited by in corpus (3)

• Efficient quantum amplitude encoding of polynomial functions
• Query and Depth Upper Bounds for Quantum Unitaries via Grover Search
• A weighted quantum ensemble of homogeneous quantum classifiers