Characterizing quantum circuits with qubit functional configurations
- URL: http://arxiv.org/abs/2110.02390v3
- Date: Thu, 12 May 2022 14:13:51 GMT
- Title: Characterizing quantum circuits with qubit functional configurations
- Authors: Zixuan Hu and Sabre Kais
- Abstract summary: We propose a theory of characterizing quantum circuits with qubit functional configurations.
We demonstrate the theory's application to the hardware-efficient ansatzes of variational quantum algorithms.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose a theory of characterizing quantum circuits with qubit functional
configurations. Any quantum circuit can be decomposed into alternating
sequences of 1-qubit unitary gates and CNOT gates. Each CNOT sequence prepares
the current quantum state into a layer of qubit functional configuration to
specify the rule for the next 1-qubit unitary sequence on how to collectively
modify the state vector entries. All the functional configuration layers on a
quantum circuit define its type which can include many other circuits sharing
the same configuration layers. Studying the functional configuration types
allows us to collectively characterize the properties and behaviors of many
quantum circuits. We demonstrate the theory's application to the
hardware-efficient ansatzes of variational quantum algorithms. For potential
applications, the functional configuration theory may allow systematic
understanding and development of quantum algorithms based on their functional
configuration types.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - 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 Circuit Ansatz: Patterns of Abstraction and Reuse of Quantum Algorithm Design [3.8425905067219492]
The paper presents a categorized catalog of quantum circuit ansatzes.
Each ansatz is described with details such as intent, motivation, applicability, circuit diagram, implementation, example, and see also.
Practical examples are provided to illustrate their application in quantum algorithm design.
arXiv Detail & Related papers (2024-05-08T12:44:37Z) - Approximating Korobov Functions via Quantum Circuits [6.460951804337735]
We construct quantum circuits that can approximate $d$-dimensional functions in the Korobov function space.
Since the Korobov space is a subspace of Sobolev spaces, our work establishes a theoretical foundation for implementing a broad class of functions on quantum computers.
arXiv Detail & Related papers (2024-04-22T20:33:53Z) - Distributed quantum architecture search [0.0]
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 for interconnected quantum processing units with specific qubit connectivity.
arXiv Detail & Related papers (2024-03-10T13:28:56Z) - Quantum simulation of excited states from parallel contracted quantum
eigensolvers [5.915403570478968]
We show that a ground-state contracted quantum eigensolver can be generalized to compute any number of quantum eigenstates simultaneously.
We introduce two excited-state CQEs that perform the excited-state calculation while inheriting many of the remarkable features of the original ground-state version of the algorithm.
arXiv Detail & Related papers (2023-11-08T23:52:31Z) - A Complete Equational Theory for Quantum Circuits [58.720142291102135]
We introduce the first complete equational theory for quantum circuits.
Two circuits represent the same unitary map if and only if they can be transformed one into the other using the equations.
arXiv Detail & Related papers (2022-06-21T17:56:31Z) - Quantum circuits for the preparation of spin eigenfunctions on quantum
computers [63.52264764099532]
Hamiltonian symmetries are an important instrument to classify relevant many-particle wavefunctions.
This work presents quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers.
arXiv Detail & Related papers (2022-02-19T00:21:46Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task.
Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate.
The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
arXiv Detail & Related papers (2021-06-06T13:15:25Z) - 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.