Related papers: Verification of Recursively Defined Quantum Circuits

Verification of Recursively Defined Quantum Circuits

URL: http://arxiv.org/abs/2404.05934v2
Date: Wed, 06 Nov 2024 20:54:12 GMT
Title: Verification of Recursively Defined Quantum Circuits
Authors: Mingsheng Ying, Zhicheng Zhang,
Abstract summary: We present a proof system for formal verification of the correctness of quantum circuits. A series of application examples are given, including (multi-qubit) controlled gates, a quantum circuit generating (multi-qubit) GHZ.
Score: 7.042810171786408
License:
Abstract: Recursive techniques have recently been introduced into quantum programming so that a variety of large quantum circuits and algorithms can be elegantly and economically programmed. In this paper, we present a proof system for formal verification of the correctness of recursively defined quantum circuits. The soundness and (relative) completeness of the proof system are established. To demonstrating its effectiveness, a series of application examples of the proof system are given, including (multi-qubit) controlled gates, a quantum circuit generating (multi-qubit) GHZ (Greenberger-Horne-Zeilinger) states, recursive definition of quantum Fourier transform, quantum state preparation, and quantum random-access memories (QRAM).

Related papers

Dynamic Runtime Assertions in Quantum Ternary Systems [1.5410557873153832]
We investigate assertions in quantum ternary systems, which are more challenging than those in quantum binary systems. We propose quantum ternary circuit designs to assert classical, entanglement, and superposition states.
arXiv Detail & Related papers (2023-12-23T17:46:51Z)
Quantum Recursive Programming with Quantum Case Statements [8.320147245667124]
A simple programming language for supporting this kind of quantum recursion is defined. A series of examples are presented to show that some quantum algorithms can be elegantly written as quantum recursion programs.
arXiv Detail & Related papers (2023-11-03T05:44:52Z)
Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z)
Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z)
Qafny: A Quantum-Program Verifier [39.47005122712576]
We present Qafny, an automated proof system for verifying quantum programs. At its core, Qafny uses a type-guided quantum proof system that translates quantum operations to classical array operations. We show how Qafny can efficiently verify important quantum algorithms, including quantum-walk algorithms, Grover's algorithm, and Shor's algorithm.
arXiv Detail & Related papers (2022-11-11T18:50:52Z)
Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
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.
arXiv Detail & Related papers (2021-12-27T21:15:35Z)
Preparation of quantum superposition using partial negation [1.911678487931003]
The speed of the preparation process and the accuracy of the prepared superposition has a special importance to the success of any quantum algorithm. The proposed method can be used to prepare the required quantum superposition in $mathcalO(n)$ steps.
arXiv Detail & Related papers (2021-09-29T11:57:44Z)
Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z)
Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z)
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)
Variational Quantum Algorithms for Steady States of Open Quantum Systems [2.740982822457262]
We propose a variational quantum algorithm to find the steady state of open quantum systems. The fidelity between the optimal mixed state and the true steady state is over 99%. This algorithm is derived from the natural idea of expressing mixed states with purification.
arXiv Detail & Related papers (2020-01-08T14:47:36Z)

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