Year: 2014
Type: article
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 give a simple way to construct efficient circuits for diagonal unitaries without ancillas, using a correspondence between Walsh functions and a basis for diagonal operators. This correspondence reduces the problem of constructing the minimal-depth circuit within a given error tolerance, for an arbitrary diagonal unitary in the 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.
Source: New Journal of Physics
Authors: Jonathan Welch, Daniel Greenbaum, Sarah Mostame, Alan Aspuru-Guzik
Institutions: Harvard University, MIT Lincoln Laboratory
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,610
OpenAlex ID: W2152620223
