QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space

• URL: http://arxiv.org/abs/2003.04462v2
• Date: Thu, 26 Mar 2020 16:28:44 GMT
• Title: QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space
• Authors: Ed Younis, Koushik Sen, Katherine Yelick, Costin Iancu
• Abstract summary: We present QFAST, a quantum synthesis tool designed to produce short circuits. We show how to generate shorter circuits by plugging in the best available third party synthesis algorithm at a given hierarchy level.
• Score: 5.406226763868874
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present QFAST, a quantum synthesis tool designed to produce short circuits and to scale well in practice. Our contributions are: 1) a novel representation of circuits able to encode placement and topology; 2) a hierarchical approach with 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. When compared against state-of-the-art techniques, although not optimal, QFAST can generate much shorter circuits for "time dependent evolution" algorithms used by domain scientists. We also show the composability and tunability of our formulation in terms of circuit depth and running time. For example, we show how to generate shorter circuits by plugging in the best available third party synthesis algorithm at a given hierarchy level. Composability enables portability across chip architectures, which is missing from the available approaches.

Related papers

• Optimizing Quantum Circuits, Fast and Slow [7.543907169342984]
  We present a framework for thinking of rewriting and resynthesis as abstract circuit transformations. We then present a radically simple algorithm, GUOQ, for optimizing quantum circuits.
  arXiv  Detail & Related papers  (2024-11-06T18:34:35Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Optimizing Variational Circuits for Higher-Order Binary Optimization [2.578242050187029]
  We propose new approaches to encode their Hamiltonian into a ready-to-implement circuit involving only two-qubit gates. We evaluate our approaches by comparing them with the state of the art, showcasing clear gains in terms of circuit depth.
  arXiv  Detail & Related papers  (2023-07-31T15:27:06Z)
• Improving Quantum Circuit Synthesis with Machine Learning [0.7894596908025954]
  We show how applying machine learning to unitary datasets permits drastic speedups for synthesis algorithms. This paper presents QSeed, a seeded synthesis algorithm that employs a learned model to quickly propose resource efficient circuit implementations of unitaries.
  arXiv  Detail & Related papers  (2023-06-09T01:53:56Z)
• A recursively partitioned approach to architecture-aware ZX Polynomial synthesis and optimization [0.0]
  We replace the approach of PauliOpt with a synthesis based search and utilize a divide and conquer method to synthesize an optimized circuit from a ZXOA library. We demonstrate a significant advantage for randomized circuits, which highlights the advantages of utilizing an architecture-aware methodology.
  arXiv  Detail & Related papers  (2023-03-30T13:29:41Z)
• Graph Neural Network Autoencoders for Efficient Quantum Circuit Optimisation [69.43216268165402]
  We present for the first time how to use graph neural network (GNN) autoencoders for the optimisation of quantum circuits. We construct directed acyclic graphs from the quantum circuits, encode the graphs and use the encodings to represent RL states. Our method is the first realistic first step towards very large scale RL quantum circuit optimisation.
  arXiv  Detail & Related papers  (2023-03-06T16:51:30Z)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• QFAST: Conflating Search and Numerical Optimization for Scalable Quantum Circuit Synthesis [5.406226763868874]
  We present a quantum synthesis algorithm designed to produce short circuits and to scale well in practice. Main contribution is a novel representation of circuits able to encode placement and topology using generic "gates" When compared against optimal depth, search based state-of-the-art techniques, QFAST produces comparable results.
  arXiv  Detail & Related papers  (2021-03-12T05:20:12Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.