Related papers: Quantum Recursive Programming with Quantum Case Statements

Quantum Recursive Programming with Quantum Case Statements

URL: http://arxiv.org/abs/2311.01725v1
Date: Fri, 3 Nov 2023 05:44:52 GMT
Title: Quantum Recursive Programming with Quantum Case Statements
Authors: Mingsheng Ying and Zhicheng Zhang
Abstract summary: 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.
Score: 8.320147245667124
License: http://creativecommons.org/licenses/by/4.0/
Abstract: We introduce a novel scheme of quantum recursive programming, in which large unitary transformations, i.e. quantum gates, can be recursively defined using quantum case statements, which are quantum counterparts of conditionals and case statements extensively used in classical programming. A simple programming language for supporting this kind of quantum recursion is defined, and its semantics is formally described. A series of examples are presented to show that some quantum algorithms can be elegantly written as quantum recursive programs.

Related papers

Verification of Recursively Defined Quantum Circuits [7.042810171786408]
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.
arXiv Detail & Related papers (2024-04-09T01:35:13Z)
Quantum Dynamic Programming [0.0]
We show how to coherently generate unitaries of recursion steps using memorized intermediate quantum states. We find that quantum dynamic programming yields an exponential reduction in circuit depth for a large class of fixed-point quantum recursions. We apply quantum dynamic programming to a recently proposed double-bracket quantum algorithm for diagonalization to obtain a new protocol for obliviously preparing a quantum state in its Schmidt basis.
arXiv Detail & Related papers (2024-03-14T08:59:22Z)
A Case for Synthesis of Recursive Quantum Unitary Programs [9.287571320531457]
Quantum programs are notoriously difficult to code and verify due to unintuitive quantum knowledge associated with quantum programming. We present Q Synth, the first quantum program synthesis framework, including a new inductive quantum programming language. Q Synth successfully synthesizes ten quantum unitary programs including quantum adder circuits, quantum eigenvalue inversion circuits and Quantum Fourier Transformation.
arXiv Detail & Related papers (2023-11-20T03:01:36Z)
A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
arXiv Detail & Related papers (2023-05-23T13:42:36Z)
Quantum Circuit Completeness: Extensions and Simplifications [44.99833362998488]
The first complete equational theory for quantum circuits has only recently been introduced. We simplify the equational theory by proving that several rules can be derived from the remaining ones. The complete equational theory can be extended to quantum circuits with ancillae or qubit discarding.
arXiv Detail & Related papers (2023-03-06T13:31:27Z)
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)
Conventions for Quantum Pseudocode [0.0]
conventions can be used for presenting any quantum algorithm down to the lowest level. In principle a formal version of quantum pseudocode could be used in a future extension of a conventional language.
arXiv Detail & Related papers (2022-11-04T16:24:45Z)
No-signalling constrains quantum computation with indefinite causal structure [45.279573215172285]
We develop a formalism for quantum computation with indefinite causal structures. We characterize the computational structure of higher order quantum maps. We prove that these rules, which have a computational and information-theoretic nature, are determined by the more physical notion of the signalling relations between the quantum systems.
arXiv Detail & Related papers (2022-02-21T13:43:50Z)
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)
Compiling quantamorphisms for the IBM Q Experience [0.0]
This paper contributes to extending the laws of classical program algebra to quantum programming. It aims at building correct-by-construction quantum circuits to be deployed on quantum devices such as those available at the IBM Q Experience.
arXiv Detail & Related papers (2020-10-21T13:32:24Z)

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