ROS: Resource-constrained Oracle Synthesis for Quantum Computers

We present a completely automatic synthesis framework for oracle functions, a central part in many quantum algorithms. The proposed framework for resource-constrained oracle synthesis (ROS) is a LUT-based hierarchical method in which every step is specifically tailored to address hardware resource constraints. ROS embeds a LUT mapper designed to simplify the successive synthesis steps, costing each LUT according to the resources used by its corresponding quantum circuit. In addition, the framework exploits a SAT-based quantum garbage management technique. Those two characteristics give ROS the ability to beat the state-of-the-art hierarchical method both in number of qubits and in number of operations. The efficiency of the framework is demonstrated by synthesizing quantum oracles for Grover's algorithm.

[1]  Robert K. Brayton,et al.  Improvements to Technology Mapping for LUT-Based FPGAs , 2007, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Lov K. Grover A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[3]  Giovanni De Micheli,et al.  LUT-Based Hierarchical Reversible Logic Synthesis , 2019, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Giovanni De Micheli,et al.  Reversible Pebbling Game for Quantum Memory Management , 2019, 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[5]  T. Monz,et al.  Real-time dynamics of lattice gauge theories with a few-qubit quantum computer , 2016, Nature.

[6]  Robert K. Brayton,et al.  DAG-aware AIG rewriting: a fresh look at combinational logic synthesis , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[7]  Giovanni De Micheli,et al.  The EPFL Logic Synthesis Libraries , 2018, ArXiv.

[8]  Michele Mosca,et al.  On the controlled-NOT complexity of controlled-NOT–phase circuits , 2018, Quantum Science and Technology.

[9]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[10]  Michele Mosca,et al.  On the CNOT-complexity of CNOT-PHASE circuits , 2017, 1712.01859.

[11]  Annie Y. Wei,et al.  Exponentially more precise quantum simulation of fermions in second quantization , 2015, 1506.01020.

[12]  Robert Wille,et al.  Exact Multiple-Control Toffoli Network Synthesis With SAT Techniques , 2009, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  Gerhard W. Dueck,et al.  A transformation based algorithm for reversible logic synthesis , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[14]  S. Debnath,et al.  Demonstration of a small programmable quantum computer with atomic qubits , 2016, Nature.

[15]  Charles H. Bennett Time/Space Trade-Offs for Reversible Computation , 1989, SIAM J. Comput..

[16]  Robert K. Brayton,et al.  ABC: An Academic Industrial-Strength Verification Tool , 2010, CAV.

[17]  Giovanni De Micheli,et al.  A best-fit mapping algorithm to facilitate ESOP-decomposition in Clifford+T quantum network synthesis , 2018, 2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC).

[18]  M. Mosca,et al.  A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits , 2012, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[19]  P. Coveney,et al.  Scalable Quantum Simulation of Molecular Energies , 2015, 1512.06860.

[20]  Mariusz Rawski Application of Functional Decomposition in Synthesis of Reversible Circuits , 2015, RC.

[21]  Rupak Majumdar,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 1997, Lecture Notes in Computer Science.

[22]  Dmitri Maslov,et al.  On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization , 2015, ArXiv.

[23]  Jens Siewert,et al.  Programmable networks for quantum algorithms. , 2003, Physical review letters.

[24]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.