• Corpus ID: 220845614

Machine Learning Optimization of Quantum Circuit Layouts

  title={Machine Learning Optimization of Quantum Circuit Layouts},
  author={Alexandru Paler and Lucian M. Sasu and Adrian Florea and Razvan Andonie},
  journal={arXiv: Quantum Physics},
The quantum circuit layout problem is to map a quantum circuit to a quantum computing device, such that the constraints of the device are satisfied. The optimality of a layout method is expressed, in our case, by the depth of the resulting circuits. We introduce QXX, a novel search-based layout method, which includes a configurable Gaussian function used to: \emph{i)} estimate the depth of the generated circuits; \emph{ii)} determine the circuit region that influences most the depth. We… 
Supervised Learning Enhanced Quantum Circuit Transformation
This paper proposes a framework which uses a policy artificial neural network trained by supervised learning on shallow circuits to help existing QCT algorithms select the most promising SWAP, and demonstrates that the transformation performance can be consistently improved on QPUs with various connectivity structures and random quantum circuits.
Qubit Routing using Graph Neural Network aided Monte Carlo Tree Search
This work proposes a new method of adding mutex-lock like variables in the authors' state representation which helps factor in the parallelization of the scheduled operations, thereby pruning the depth of the output circuit.
Exploring ab initio machine synthesis of quantum circuits
Methods for the ab initio creation of circuits within a machine, either a classical computer or a hybrid quantum-classical device are explored and a range of techniques including: methods for introducing new gate structures, optimisation of parameterised circuits and choices of cost functions are considered.
Energy Cost of Quantum Circuit Optimisation: Predicting That Optimising Shor’s Algorithm Circuit Uses 1 GWh
It is concluded that state-of-the-art quantum software frameworks have to massively improve their scalability to be practical for large circuits and use energy as the long-term cost of operating hardware.
NISQ circuit compilation is the travelling salesman problem on a torus
This work bridges a theoretical and practical gap between classical circuit design automation and the emerging field of quantum circuit optimisation with a novel approach to quantum circuit compilation (QCC).
Novel Quantum Algorithms to Minimize Switching Functions Based on Graph Partitions
A new hybrid classic quantum algorithm using Grover’s algorithm and symmetric functions to minimize small Disjoint Sum of Product (DSOP) and Sum of product (SOP) for Boolean switching functions is introduced.


Quantum Circuit Simplification and Level Compaction
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.
Barren plateaus in quantum neural network training landscapes
It is shown that for a wide class of reasonable parameterized quantum circuits, the probability that the gradient along any reasonable direction is non-zero to some fixed precision is exponentially small as a function of the number of qubits.
Classical Optimizers for Noisy Intermediate-Scale Quantum Devices
We present a collection of optimizers tuned for usage on Noisy Intermediate-Scale Quantum (NISQ) devices. Optimizers have a range of applications in quantum computing, including the Variational
Quantum circuit optimizations for NISQ architectures
This work constructs a circuit synthesis scheme that takes as input the qubit connectivity graph and a quantum circuit over the gate set generated by $\{\text{CNOT,R_{Z}\}$ and outputs a circuit that respects the connectivity of the device.
An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures
A methodology which addresses the problem of properly mapping quantum functionality to a realization which satisfies all constraints given by the architecture and, at the same time, keeps the overhead in terms of additionally required quantum gates minimal is proposed.
Quantum circuit learning
A classical-quantum hybrid algorithm for machine learning on near-term quantum processors, which is hybridizing a low-depth quantum circuit and a classical computer for machinelearning, paves the way toward applications of near- term quantum devices for quantum machine learning.
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
A simplification strategy for ZX-diagrams is given based on the two graph transformations of local complementation and pivoting and it is shown that the resulting reduced diagram can be transformed back into a quantum circuit.
Optimality Study of Existing Quantum Computing Layout Synthesis Tools
The QUEKO benchmarks are constructed and the NP-completeness of the layout synthesis problem for quantum computing is proved, suggesting substantial room for improvement of the efficiency of quantum computer by better layout synthesis tools.
On the Influence of Initial Qubit Placement During NISQ Circuit Compilation
A novel heuristic and cost model is introduced to estimate the number of gates necessary to adapt a circuit to a given NISQ architecture and preliminary results indicate that cost reductions of up to 10% can be achieved for practical circuit instances on realistic NISZ architectures only by placing qubits differently than default (trivial placement).
QASMBench: A Low-level QASM Benchmark Suite for NISQ Evaluation and Simulation
A low-level, light-weighted, and easy-to-use benchmark suite called QASMBench based on the OpenQASM assembly representation, which collects commonly seen quantum algorithms and routines from a variety of domains including chemistry, simulation, linear algebra, searching, optimization, quantum arithmetic, machine learning, fault tolerance, cryptography, etc.