Low Depth Phase Oracle Using a Parallel Piecewise Circuit

Abstract

We explore the important task of applying a phase $\exp (if(x))$ to a computational basis state $|x⟩$. The closely related task of rotating a target qubit by an angle depending on $f(x)$ is also studied. Such operations are key in many quantum subroutines, and frequently $f(x)$ can be well-approximated by a piecewise function; examples range from the application of diagonal Hamiltonian terms (such as the Coulomb interaction) in grid-based many-body simulation, to derivative pricing algorithms. Here we exploit a parallelisation of the piecewise approach so that all constituent elementary rotations are performed simultaneously, that is, we achieve a total rotation depth of one. Moreover, we explore the use of recursive catalyst `towers' to implement these elementary rotations efficiently. We find that strategies prioritising execution speed can achieve circuit depth as low as $O(\log n+\log S)$ for a register of $n$ qubits and a piecewise approximation of $S$ sections (presuming prior preparation of enabling resource states), albeit total qubit count then scales with $S$. In the limit of multiple repetitions of the oracle, we find that catalyst tower approaches have an $O(S\cdot n)$ T-count.

16 pages, table I updated

References in corpus (15)

• Quantum algorithm for solving linear systems of equations
• Quantum random access memory
• Novel constructions for the fault-tolerant Toffoli gate
• Efficient synthesis of probabilistic quantum circuits with fallback
• Grid-based methods for chemistry simulations on a quantum computer
• Reducing the quantum computing overhead with complex gate distillation
• Modelling semiconductor spin qubits and their charge noise environment for quantum gate fidelity estimation
• Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods
• Shorter quantum circuits via single-qubit gate approximation
• Derivative Pricing using Quantum Signal Processing
• Quantum Simulation of Realistic Materials in First Quantization Using Non-local Pseudopotentials
• Option pricing under stochastic volatility on a quantum computer
• Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations
• Path integral simulation of exchange interactions in CMOS spin qubits
• Approximate real-time evolution operator for potential with one ancillary qubit and application to first-quantized Hamiltonian simulation

Cited by in corpus (2)

• Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer
• Quantum algorithm for unstructured search of ranked targets