• 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}
}
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… 

Figures and Tables from this paper

Variational quantum compiling with double Q-learning

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.

Quantum Architecture Search with Meta‐Learning

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

Efficient decomposition of single-qubit gates intoVbasis circuits

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.

Quantum compiling with diffusive sets of gates

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.

Quantum-assisted quantum compiling

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.

Experimental realisation of Shor's quantum factoring algorithm using qubit recycling

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.

Compiling quantum circuits to realistic hardware architectures using temporal planners

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.

Quantum circuits for general multiqubit gates.

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.

Efficient decomposition of quantum gates.

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.

Efficient discrete approximations of quantum gates

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.

Constructing arbitrary Steane code single logical qubit fault-tolerant gates

  • 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.

Elementary gates for quantum computation.

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.