Efficient quantum circuits for diagonal unitaries without ancillas

DOI10.1088/1367-2630/16/3/033040MaRDI QIDQ5143192zbMATH OpenOpenAlexFDO

Authors Jonathan Welch, Daniel Greenbaum, Sarah Mostame, Alán Aspuru-Guzik

Publication date 11 January 2021

Published in New Journal of Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://arxiv.org/abs/1306.3991

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum gates (81P65)

Abstract: The accurate evaluation of diagonal unitary operators is often the most resource-intensive element of quantum algorithms such as real-space quantum simulation and Grover search. Efficient circuits have been demonstrated in some cases but generally require ancilla registers, which can dominate the qubit resources. In this paper, we point out a correspondence between Walsh functions and a basis for diagonal operators that gives a simple way to construct efficient circuits for diagonal unitaries without ancillas. This correspondence reduces the problem of constructing the minimal-depth circuit within a given error tolerance, for an arbitrary diagonal unitary $e^{if(hatx)}$ in the $|x>$ basis, to that of finding the minimal-length Walsh-series approximation to the function $f(x)$. We apply this approach to the quantum simulation of the classical Eckart barrier problem of quantum chemistry, demonstrating that high-fidelity quantum simulations can be achieved with few qubits and low depth.

Recommendations

• Efficient circuits for exact-universal computation with qudits
• Asymptotically optimal circuits for arbitrary n-qubit diagonal computations
• Diagonal-unitary 2-design and their implementations by quantum circuits
• Efficient Universal Quantum Circuits
• scientific article; zbMATH DE number 5666680
• Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits
• EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES
• Constructing approximately diagonal quantum gates
• Generating a state t-design by diagonal quantum circuits

Cites work

• scientific article; zbMATH DE number 4040158 (Why is no real title available?)
• scientific article; zbMATH DE number 49667 (Why is no real title available?)
• scientific article; zbMATH DE number 1749716 (Why is no real title available?)
• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• Asymptotically optimal circuits for arbitrary n-qubit diagonal computations
• Function Approximation by Walsh Series
• On the Product of Semi-Groups of Operators
• Quantum computation and quantum information. 10th anniversary edition
• Simulating quantum systems on a quantum computer
• Upper Bounds on Walsh Transforms

Cited in

(12)

• Asymptotically optimal circuits for arbitrary n-qubit diagonal computations
• Boolean satisfiability in quantum compilation
• Quantum algorithm for learning secret strings and its experimental demonstration
• Approximate real-time evolution operator for potential with one ancillary qubit and application to first-quantized Hamiltonian simulation
• Quantum circuits for discrete-time quantum walks with position-dependent coin operator
• The theory of variational hybrid quantum-classical algorithms
• Quantum simulation-based optimization for cooling system design
• Efficient and scalable quantum walk algorithms via the quantum Fourier transform
• Vibration analysis of cyclic symmetrical systems by quantum algorithms
• Programmable quantum simulation by dynamic Hamiltonian engineering
• scientific article; zbMATH DE number 5320330 (Why is no real title available?)
• A quantum walk-assisted approximate algorithm for bounded NP optimisation problems

This page was built for publication: Efficient quantum circuits for diagonal unitaries without ancillas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5143192)