# QuantumCircuitOpt: An Open-source Framework for Provably Optimal Quantum Circuit Design

@article{Nagarajan2021QuantumCircuitOptAO, title={QuantumCircuitOpt: An Open-source Framework for Provably Optimal Quantum Circuit Design}, author={Harsha Nagarajan and Owen Lockwood and Carleton Coffrin}, journal={2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)}, year={2021}, pages={55-63} }

In recent years, the quantum computing community has seen an explosion of novel methods to implement non-trivial quantum computations on near-term hardware. An important direction of research has been to decompose an arbitrary entangled state, represented as a unitary, into a quantum circuit, that is, a sequence of gates supported by a quantum processor. It has been well known that circuits with longer decompositions and more entangling multi-qubit gates are error-prone for the current noisy…

## 3 Citations

Efficient quantum gate decomposition via adaptive circuit compression

- Computer Science
- 2022

A novel quantum gate approximation algorithm based on the application of parametric two-qubit gates in the synthesis process providing the most optimal gate count in the majority of the addressed quantum circuits is reported.

An Empirical Review of Optimization Techniques for Quantum Variational Circuits

- Computer Science, PhysicsArXiv
- 2022

A large number of problems and optimizers evaluated yields strong empirical guidance for choosing optimizers for QVCs that is currently lacking, and includes both classical and quantum data based optimization routines.

Efficient variational synthesis of quantum circuits with coherent multi-start optimization

- Computer Science
- 2022

This work considers the problem of the variational quantum circuit synthesis into a gate set consisting of the CNOT gate and arbitrary single-qubit (1q) gates and proposes a coherent optimization of the architecture together with 1q gates which appears to work surprisingly well in practice.

## References

SHOWING 1-10 OF 38 REFERENCES

Quantum-assisted quantum compiling

- Computer ScienceQuantum
- 2019

This work proposes a variational hybrid quantum-classical algorithm called quantum-assisted quantum compiling (QAQC), and presents both gradient-free and gradient-based approaches to minimizing the cost of this algorithm's cost.

Automated optimization of large quantum circuits with continuous parameters

- Computer ScienceArXiv
- 2017

An automated methods for optimizing quantum circuits of the size and type expected in quantum computations that outperform classical computers are developed and implemented and a collection of fast algorithms capable of optimizing large-scale quantum circuits are reported.

Quantum Algorithm Implementations for Beginners

- Computer Science, PhysicsACM Transactions on Quantum Computing
- 2022

This review aims to explain the principles of quantum programming, which are quite different from classical programming, with straightforward algebra that makes understanding of the underlying fascinating quantum mechanical principles optional.

Quantum Circuit Simplification and Level Compaction

- Computer Science, PhysicsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- 2008

This paper considers a local optimization technique based on templates to simplify and reduce the depth of nonoptimal quantum circuits and shows how templates can be used to compact the number of levels of a quantum circuit.

On the CNOT-cost of TOFFOLI gates

- PhysicsQuantum Inf. Comput.
- 2009

It is proved that the n-qubit analogue of the TOFFOLI requires at least 2n CNOT gates, and a complete classification of three-qu bit diagonaloperators by their CNOT-cost, which holds even if ancilla qubits are available.

QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space

- Computer Science
- 2020

A novel representation of circuits able to encode placement and topology and an iterative refinement formulation that combines "coarse-grained" fast optimization during circuit structure search with a good, but slower, optimization stage only in the final circuit instantiation stage is presented.

Elementary gates for quantum computation.

- MathematicsPhysical review. A, Atomic, molecular, and optical physics
- 1995

U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.

Quantum Computing in the NISQ era and beyond

- PhysicsQuantum
- 2018

Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future, and the 100-qubit quantum computer will not change the world right away - but it should be regarded as a significant step toward the more powerful quantum technologies of the future.

Optimization of Circuits for IBM's Five-Qubit Quantum Computers

- Computer Science, Physics2018 21st Euromicro Conference on Digital System Design (DSD)
- 2018

It is shown how Clifford+T circuits can efficiently be mapped into the two IBM quantum computers with 5 qubits and shown that the optimized circuits can considerably reduce the gate count and number of levels and thus produce results with better fidelity.

Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis

- Computer ScienceIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- 2006

This paper constitutes the first successful experience of applying formal methods and satisfiability to quantum logic synthesis, thus synthesizing in principle arbitrary multi-output Boolean functions with quantum gate library.