Circuit Symmetry Verification Mitigates Quantum-Domain Impairments
- URL: http://arxiv.org/abs/2112.13904v2
- Date: Sat, 27 Aug 2022 13:43:54 GMT
- Title: Circuit Symmetry Verification Mitigates Quantum-Domain Impairments
- Authors: Yifeng Xiong, Daryus Chandra, Soon Xin Ng, Lajos Hanzo
- Abstract summary: We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
- Score: 69.33243249411113
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: State-of-the-art noisy intermediate-scale quantum computers require
low-complexity techniques for the mitigation of computational errors inflicted
by quantum decoherence. Symmetry verification constitutes a class of quantum
error mitigation (QEM) techniques, which distinguishes erroneous computational
results from the correct ones by exploiting the intrinsic symmetry of the
computational tasks themselves. Inspired by the benefits of quantum switch in
the quantum communication theory, we propose beneficial techniques for
circuit-oriented symmetry verification that are capable of verifying the
commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the spatio-temporal stabilizer (STS) technique, which
generalizes the conventional quantum-domain stabilizer formalism to
circuit-oriented stabilizers. The applicability and implementational strategies
of the proposed techniques are demonstrated by using practical quantum
algorithms, including the quantum Fourier transform (QFT) and the quantum
approximate optimization algorithm (QAOA).
Related papers
- Equivalence Checking of Parameterised Quantum Circuits [13.796569260568939]
We propose a novel compact representation for PQCs based on tensor decision diagrams.
We present an algorithm for verifying PQC equivalence without the need for instantiation.
arXiv Detail & Related papers (2024-04-29T06:25:00Z) - Symmetry-Based Quantum Circuit Mapping [2.51705778594846]
We introduce a quantum circuit remapping algorithm that leverages the intrinsic symmetries in quantum processors.
This algorithm identifies all topologically equivalent circuit mappings by constraining the search space using symmetries and accelerates the scoring of each mapping using vector computation.
arXiv Detail & Related papers (2023-10-27T10:04:34Z) - QuBEC: Boosting Equivalence Checking for Quantum Circuits with QEC
Embedding [4.15692939468851]
We propose a Decision Diagram-based quantum equivalence checking approach, QuBEC, that requires less latency compared to existing techniques.
Our proposed methodology reduces verification time on certain benchmark circuits by up to $271.49 times$.
arXiv Detail & Related papers (2023-09-19T16:12:37Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Quantum-Error-Mitigation Circuit Groups for Noisy Quantum Metrology [0.0]
Quantum technologies work by utilizing properties inherent in quantum systems such as quantum coherence and quantum entanglement.
Quantum technologies are fragile against an interaction with an environment (decoherence) and in order to utilize them with high accuracy we need to develop error mitigation techniques.
arXiv Detail & Related papers (2023-03-03T10:01:42Z) - 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) - Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement.
Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z) - An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem.
The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
arXiv Detail & Related papers (2020-05-06T14:18:44Z) - Using Quantum Metrological Bounds in Quantum Error Correction: A Simple
Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates.
Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
arXiv Detail & Related papers (2020-04-24T17:58:10Z) - Policy Gradient based Quantum Approximate Optimization Algorithm [2.5614220901453333]
We show that policy-gradient-based reinforcement learning algorithms are well suited for optimizing the variational parameters of QAOA in a noise-robust fashion.
We analyze the performance of the algorithm for quantum state transfer problems in single- and multi-qubit systems.
arXiv Detail & Related papers (2020-02-04T00:46:51Z)
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.