Distributed quantum architecture search
- URL: http://arxiv.org/abs/2403.06214v1
- Date: Sun, 10 Mar 2024 13:28:56 GMT
- Title: Distributed quantum architecture search
- Authors: Haozhen Situ, Zhimin He, Shenggen Zheng, Lvzhou Li
- Abstract summary: Variational quantum algorithms, inspired by neural networks, have become a novel approach in quantum computing.
Quantum architecture search tackles this by adjusting circuit structures along with gate parameters to automatically discover high-performance circuit structures.
We propose an end-to-end distributed quantum architecture search framework, where we aim to automatically design distributed quantum circuit structures.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Variational quantum algorithms, inspired by neural networks, have become a
novel approach in quantum computing. However, designing efficient parameterized
quantum circuits remains a challenge. Quantum architecture search tackles this
by adjusting circuit structures along with gate parameters to automatically
discover high-performance circuit structures. In this study, we propose an
end-to-end distributed quantum architecture search framework, where we aim to
automatically design distributed quantum circuit structures for interconnected
quantum processing units with specific qubit connectivity. We devise a circuit
generation algorithm which incorporates TeleGate and TeleData methods to enable
nonlocal gate implementation across quantum processing units. While taking into
account qubit connectivity, we also incorporate qubit assignment from logical
to physical qubits within our QAS framework. A two-stage progressive
training-free strategy is employed to evaluate extensive circuit structures
without circuit training costs. Through numerical experiments on three VQE
tasks, the efficacy and efficiency of our scheme is demonstrated.
Related papers
- Profiling quantum circuits for their efficient execution on single- and multi-core architectures [1.7340157845783293]
This study introduces graph theory-based metrics extracted from their qubit interaction graph and gate dependency graph.
It uncovers a connection between parameters rooted in both qubit interaction and gate dependency graphs, and the performance metrics for quantum circuit mapping.
arXiv Detail & Related papers (2024-07-17T15:08:50Z) - 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) - An RNN-policy gradient approach for quantum architecture search [7.616832563471534]
Variational quantum circuits are one of the promising ways to exploit the advantages of quantum computing.
The design of the quantum circuit architecture might greatly affect the performance capability of the quantum algorithms.
The quantum architecture search is the process of automatically designing quantum circuit architecture.
arXiv Detail & Related papers (2024-05-09T16:44:35Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Quantum Deep Dreaming: A Novel Approach for Quantum Circuit Design [0.0]
Quantum Deep Dreaming (QDD) is an algorithm that generates optimal quantum circuit architectures for specified objectives.
We demonstrate that QDD successfully generates, or 'dreams', circuits of six qubits close to ground state energy.
arXiv Detail & Related papers (2022-11-05T22:16:10Z) - Quantum Neural Architecture Search with Quantum Circuits Metric and
Bayesian Optimization [2.20200533591633]
We propose a new quantum gates distance that characterizes the gates' action over every quantum state.
Our approach significantly outperforms the benchmark on three empirical quantum machine learning problems.
arXiv Detail & Related papers (2022-06-28T16:23:24Z) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - Variational quantum compiling with double Q-learning [0.37798600249187286]
We propose a variational quantum compiling (VQC) algorithm based on reinforcement learning (RL)
An agent is trained to sequentially select quantum gates from the native gate alphabet and the qubits they act on by double Q-learning.
It can reduce the errors of quantum algorithms due to decoherence process and gate noise in NISQ devices.
arXiv Detail & Related papers (2021-03-22T06:46:35Z) - QUANTIFY: A framework for resource analysis and design verification of
quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits.
It is based on Google Cirq and is developed with Clifford+T circuits in mind.
For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z)
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.