50,201 research outputs found
Gate-Level Simulation of Quantum Circuits
While thousands of experimental physicists and chemists are currently trying
to build scalable quantum computers, it appears that simulation of quantum
computation will be at least as critical as circuit simulation in classical
VLSI design. However, since the work of Richard Feynman in the early 1980s
little progress was made in practical quantum simulation. Most researchers
focused on polynomial-time simulation of restricted types of quantum circuits
that fall short of the full power of quantum computation. Simulating quantum
computing devices and useful quantum algorithms on classical hardware now
requires excessive computational resources, making many important simulation
tasks infeasible. In this work we propose a new technique for gate-level
simulation of quantum circuits which greatly reduces the difficulty and cost of
such simulations. The proposed technique is implemented in a simulation tool
called the Quantum Information Decision Diagram (QuIDD) and evaluated by
simulating Grover's quantum search algorithm. The back-end of our package,
QuIDD Pro, is based on Binary Decision Diagrams, well-known for their ability
to efficiently represent many seemingly intractable combinatorial structures.
This reliance on a well-established area of research allows us to take
advantage of existing software for BDD manipulation and achieve unparalleled
empirical results for quantum simulation
Design Automation and Design Space Exploration for Quantum Computers
A major hurdle to the deployment of quantum linear systems algorithms and
recent quantum simulation algorithms lies in the difficulty to find inexpensive
reversible circuits for arithmetic using existing hand coded methods. Motivated
by recent advances in reversible logic synthesis, we synthesize arithmetic
circuits using classical design automation flows and tools. The combination of
classical and reversible logic synthesis enables the automatic design of large
components in reversible logic starting from well-known hardware description
languages such as Verilog. As a prototype example for our approach we
automatically generate high quality networks for the reciprocal , which is
necessary for quantum linear systems algorithms.Comment: 6 pages, 1 figure, in 2017 Design, Automation & Test in Europe
Conference & Exhibition, DATE 2017, Lausanne, Switzerland, March 27-31, 201
Theory of variational quantum simulation
The variational method is a versatile tool for classical simulation of a
variety of quantum systems. Great efforts have recently been devoted to its
extension to quantum computing for efficiently solving static many-body
problems and simulating real and imaginary time dynamics. In this work, we
first review the conventional variational principles, including the
Rayleigh-Ritz method for solving static problems, and the Dirac and Frenkel
variational principle, the McLachlan's variational principle, and the
time-dependent variational principle, for simulating real time dynamics. We
focus on the simulation of dynamics and discuss the connections of the three
variational principles. Previous works mainly focus on the unitary evolution of
pure states. In this work, we introduce variational quantum simulation of mixed
states under general stochastic evolution. We show how the results can be
reduced to the pure state case with a correction term that takes accounts of
global phase alignment. For variational simulation of imaginary time evolution,
we also extend it to the mixed state scenario and discuss variational Gibbs
state preparation. We further elaborate on the design of ansatz that is
compatible with post-selection measurement and the implementation of the
generalised variational algorithms with quantum circuits. Our work completes
the theory of variational quantum simulation of general real and imaginary time
evolution and it is applicable to near-term quantum hardware.Comment: 41 pages, accepted by Quantu
- …