Design Automation and Design Space Exploration for Quantum Computers

Abstract

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 $1/x$, which is necessary for quantum linear systems algorithms.

6 pages, 1 figure, in 2017 Design, Automation & Test in Europe Conference & Exhibition, DATE 2017, Lausanne, Switzerland, March 27-31, 2017

References in corpus (8)

• Elementary gates for quantum computation
• Real-time dynamics of lattice gauge theories with a few-qubit quantum computer
• Demonstration of a small programmable quantum computer with atomic qubits
• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization
• Techniques for the Synthesis of Reversible Toffoli Networks
• Reversible circuit compilation with space constraints
• Quantum Circuit Design of Integer Division Optimizing Ancillary Qubits and T-Count