• Corpus ID: 249926909

Exploring ab initio machine synthesis of quantum circuits

@inproceedings{Meister2022ExploringAI,
  title={Exploring ab initio machine synthesis of quantum circuits},
  author={Richard Meister and Cica Gustiani and Simon C. Benjamin},
  year={2022}
}
Gate-level quantum circuits are often derived manually from higher level algorithms. While this suffices for small implementations and demonstrations, ultimately automatic circuit design will be required to realise complex algorithms using hardware-specific operations and connectivity. Here we explore methods for the ab initio creation of circuits within a machine, either a classical computer or a hybrid quantum-classical device. We consider a range of techniques including: methods for introducing… 

Figures and Tables from this paper

Approximate encoding of quantum states using shallow circuits

TLDR
A universal method to prepare target states using local gates and represents a significant improvement over known strategies to create an approximate encoding of the target state using a limited number of gates is developed.

Exploiting subspace constraints and ab initio variational methods for quantum chemistry

TLDR
A novel approach to constraining the circuit evolution in the physically relevant subspace greatly improves performance and compactness of the circuits and can outperform human-designed circuits such as the coupled-cluster or hardware-efficient ans¨atze.

References

SHOWING 1-10 OF 67 REFERENCES

Parallelizing quantum circuit synthesis

TLDR
The software is used to present examples where parallelization offers a significant speedup on the runtime, as well as directly confirm that the 4-qubit 1-bit full adder has optimal T-count 7 and T-depth 3.

Robust quantum compilation and circuit optimisation via energy minimisation

TLDR
A method for automatically recompiling a quantum circuit A into a target circuit B, with the goal that both circuits have the same action on a specific input, is explored, and may enable `blind' compilation i.e. harnessing a device whose response to control parameters is deterministic but unknown.

Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search

TLDR
The experimental results on extensive realistic circuits confirm that the proposed method is efficient and the number of added gates of the algorithm is, on average, only 57% of that of state-of-the-art algorithms on IBM Q20 (Tokyo), the most recent IBM quantum device.

Quantum-assisted quantum compiling

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

Efficient decomposition of unitary matrices in quantum circuit compilers

TLDR
This work base the implementation of the decomposition technique on Quantum Shannon Decomposition, which generates O(344n) controlled-not gates for an n-qubit input gate, and implements optimizations to take advantage of the potential underlying structure in the input or intermediate matrices.

Exploiting subspace constraints and ab initio variational methods for quantum chemistry

TLDR
A novel approach to constraining the circuit evolution in the physically relevant subspace greatly improves performance and compactness of the circuits and can outperform human-designed circuits such as the coupled-cluster or hardware-efficient ans¨atze.

Trapped-Ion Quantum Computer with Robust Entangling Gates and Quantum Coherent Feedback

Quantum computers are expected to achieve a significant speed-up over classical computers in solving a range of computational problems. Chains of ions held in a linear Paul trap are a promising

Circuit Transformations for Quantum Architectures

TLDR
This work first considers the qubit movement subproblem and uses the routing via matchings framework to prove tighter bounds on parallel routing, and gives new routing procedures for common architecture graphs and for the generalized hierarchical product of graphs, which produces subgraphs of the Cartesian product.

Machine Learning of Noise-Resilient Quantum Circuits

TLDR
A general framework based on machine learning for reducing the impact of quantum hardware noise on quantum circuits, called noise-aware circuit learning (NACL), applies to circuits designed to compute a unitary transformation, prepare a set of quantum states, or estimate an observable of a many-qubit state.

Quantum Circuit Transformation: A Monte Carlo Tree Search Framework

TLDR
A Monte Carlo Tree Search (MCTS) framework is proposed to tackle the circuit transformation problem, which enables the search process to go much deeper and empirical results show that the MCTS-based algorithms can reduce the size (depth, resp.) overhead by, on average, 66% when compared with t|ketPLX − right⟩.
...