Efficient state initialization by a quantum spectral filtering algorithm

Abstract

An algorithm that initializes a quantum register to a state with a specified energy range is given, corresponding to a quantum implementation of the celebrated Feit-Fleck method. This is performed by introducing a nondeterministic quantum implementation of a standard spectral filtering procedure combined with an apodization technique, allowing for accurate state initialization. It is shown that the implementation requires only two ancilla qubits. A lower bound for the total probability of success of this algorithm is derived, showing that this scheme can be realized using a finite, relatively low number of trials. Assuming the time evolution can be performed efficiently and using a trial state polynomially close to the desired states, it is demonstrated that the number of operations required scales polynomially with the number of qubits. Tradeoffs between accuracy and performance are demonstrated in a simple example: the harmonic oscillator. This algorithm would be useful for the initialization phase of the simulation of quantum systems on digital quantum computers.

arXiv comment12 pages, 4 figures, revised version

References in corpus (29)

• Quantum Computing
• Quantum Simulation
• Simulated Quantum Computation of Molecular Energies
• 14-qubit entanglement: creation and coherence
• On the Power of One Bit of Quantum Information
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
• Natural and artificial atoms for quantum computation
• Semiclassical Fourier Transform for Quantum Computation
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Efficient Simulation of Quantum Systems by Quantum Computers
• Simulating Physical Phenomena by Quantum Networks
• Simulating chemistry using quantum computers
• Quantum Algorithms for Fermionic Simulations
• Computational Complexity of interacting electrons and fundamental limitations of Density Functional Theory
• Review of Decoherence Free Subspaces, Noiseless Subsystems, and Dynamical Decoupling
• Higher Order Decompositions of Ordered Operator Exponentials
• Quantum circuits with uniformly controlled one-qubit gates
• Simulating quantum mechanics on a quantum computer
• Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas
• Quantum simulation of the single-particle Schrodinger equation
• Nonunitary quantum circuit
• Quantum Simulator for Transport Phenomena in Fluid Flows
• Introduction to Quantum Algorithms for Physics and Chemistry
• Eigenvector Approximation Leading to Exponential Speedup of Quantum Eigenvalue Calculation
• Programmable networks for quantum algorithms
• A Split-Step Numerical Method for the Time-Dependent Dirac Equation in 3-D Axisymmetric Geometry
• Ancilla Approximable Quantum State Transformations

Cited by in corpus (4)

• Algorithm for the solution of the Dirac equation on digital quantum computers
• Anisotropic flow fluctuation as a possible signature of clustered nuclear geometry in O-O collisions at the Large Hadron Collider
• Quantum homotopy perturbation method for nonlinear dissipative ordinary differential equations
• Optimal Coherent Quantum Phase Estimation via Tapering