Deterministic and Entanglement-Efficient Preparation of Amplitude-Encoded Quantum Registers
- 4 August 2022
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 18 (2) , 024013
Abstract
Quantum computing promises to provide exponential speed-ups to certain classes of problems. In many such algorithms, a classical vector is encoded in the amplitudes of a quantum state . However, efficiently preparing is known to be a difficult problem because an arbitrary state of qubits generally requires approximately entangling gates, which results in significant decoherence on today’s noisy intermediate-scale quantum (NISQ) computers. We present a deterministic (nonvariational) algorithm that allows us to flexibly reduce the quantum resources required for state preparation in an entanglement-efficient manner. Although this comes at the expense of reduced theoretical fidelity, actual fidelities on current NISQ computers might actually be higher due to reduced decoherence. We show this to be true for various cases of interest, such as the normal and log-normal distributions. For low-entanglement states, our algorithm can prepare states with more than an order of magnitude fewer entangling gates as compared with isometric decomposition.
Keywords
All Related Versions
Funding Information
- National Research Foundation, Singapore
This publication has 35 references indexed in Scilit:
- Constructive Representation of Functions in Low-Rank Tensor FormatsConstructive Approximation, 2012
- The Alternating Linear Scheme for Tensor Optimization in the Tensor Train FormatSIAM Journal on Scientific Computing, 2012
- Quantum-state preparation with universal gate decompositionsPhysical Review A, 2011
- Tensor-Train DecompositionSIAM Journal on Scientific Computing, 2011
- Efficient quantum state tomographyNature Communications, 2010
- Quantum Algorithm for Linear Systems of EquationsPhysical Review Letters, 2009
- Quantum circuits with uniformly controlled one-qubit gatesPhysical Review A, 2005
- The density-matrix renormalization groupReviews of Modern Physics, 2005
- Efficient Classical Simulation of Slightly Entangled Quantum ComputationsPhysical Review Letters, 2003
- The Approximation of One Matrix by Another of Lower RankPsychometrika, 1936