• Corpus ID: 199543936

# Quantum compiling on locally adjusted circuits of designated architecture

@article{Singh2019QuantumCO,
title={Quantum compiling on locally adjusted circuits of designated architecture},
author={Rahul Pratap Singh and Aikaterini Mandilara},
journal={arXiv: Quantum Physics},
year={2019}
}
• Published 12 August 2019
• Physics
• arXiv: Quantum Physics
We propose a method for compiling arbitrary $n$-qubit gates via circuits of fixed architecture supplemented with a sufficient number of adjustable single-qubit operations. The circuits are tested against efficiency requirements and then a method for identifying the parameters of the single-qubit operations is applied. The latter extends quantum control techniques developed by G. Harel and V. Akulin $\left[\right.$Phys.Rev.Lett. 82, 1 (1999)$\left.\right]$ and stays computationally tractable for…
2 Citations

## Figures and Tables from this paper

• Computer Science
ArXiv
• 2021
A variational quantum compiling (VQC) algorithm based on reinforcement learning is proposed in order to automatically design the structure of quantum circuit for VQC with no human intervention, and can reduce the errors of quantum algorithms due to decoherence process and gate noise in NISQ devices, and enable quantum algorithms especially for complex algorithms to be executed within coherence time.
• Computer Science
• 2022
Simulation results on variational quantum compiling (VQC) and quantum approximate optimization algorithm (QAOA) show that the architectures optimized by MetaQAS converge faster than a state‐of‐the‐art gradient‐based QAS algorithm, namely DQAS.

## References

SHOWING 1-10 OF 33 REFERENCES

• Computer Science
• 2013
The first constructive algorithms for compiling single-qubit unitary gates into circuits over the universal $V$ basis are developed, an alternative universal basis to the more commonly studied $\{H,T\}$ basis.
• Computer Science
Physical Review A
• 2018
It is proved that the number of gates sufficient for reaching a precision $\varepsilon$ scales as 1/1/log 3 / log 2 while the pre-compilation time is increased as compared to the Solovay-Kitaev algorithm by the exponential factor 3/2.
• Computer Science
Quantum
• 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.
• Physics, Computer Science
2013 Conference on Lasers & Electro-Optics Europe & International Quantum Electronics Conference CLEO EUROPE/IQEC
• 2013
This work demonstrates a scalable version of Shor's quantum factoring algorithm in which then qubit control register is replaced by a single qubit that is recycled n times: the total number of qubits is one third of that required in the standard protocol.
• Computer Science
ArXiv
• 2017
This work investigates the application of temporal planners to the problem of compiling quantum circuits to newly emerging quantum hardware, and generates a test suite of compilation problems for QAOA circuits of various sizes to a realistic hardware architecture.
• Physics
Physical review letters
• 2004
A generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits-a unitary transformation with 4(n) degrees of freedom is considered, and a method based on the so-called cosine-sine matrix decomposition is presented.
• Computer Science
Physical review letters
• 2004
In this work, the matrix representation of an arbitrary multiqubit gate is considered and the number of controlled NOT gates is O(4(n)) which coincides with the theoretical lower bound.
• Computer Science
• 2002
Here it is proved that using certain sets of base gates quantum compiling requires a string length that is linear in log 1/e, a result which matches the lower bound from counting volume up to constant factor.
• A. Fowler
• Computer Science
Quantum Inf. Comput.
• 2011
The method presented is numerical and scales exponentially with the number of gates used in the approximation, and for the specific case of arbitrary single-qubit gates and the fault-tolerant gates permitted by the concatenated 7-qu bit Steane code, it finds gate sequences sufficiently long and accurate to permit the Fault-Tolerant factoring of numbers thousands of bits long.
• Mathematics
Physical 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.