Quantum Control Machine: The Limits of Control Flow in Quantum Programming

• URL: http://arxiv.org/abs/2304.15000v5
• Date: Tue, 26 Mar 2024 15:28:28 GMT
• Title: Quantum Control Machine: The Limits of Control Flow in Quantum Programming
• Authors: Charles Yuan, Agnes Villanyi, Michael Carbin,
• Abstract summary: We provide a complete characterization of the properties of control flow abstractions that are correctly realizable on a quantum computer. We show how this design enables a developer to correctly express control flow in quantum algorithms using a program counter in place of logic gates.
• Score: 9.481014977048282
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum algorithms for tasks such as factorization, search, and simulation rely on control flow such as branching and iteration that depends on the value of data in superposition. High-level programming abstractions for control flow, such as switches, loops, and higher-order functions, are ubiquitous in classical languages. By contrast, many quantum languages do not provide high-level abstractions for control flow in superposition, and instead require the use of hardware-level logic gates to implement such control flow. The reason for this gap is that whereas a classical computer supports control flow using a program counter that can depend on data, the typical architecture of a quantum computer does not provide a program counter that can depend on data in superposition. As a result, the complete set of control flow abstractions that can be correctly realized on a quantum computer has not yet been established. In this work, we provide a complete characterization of the properties of control flow abstractions that are correctly realizable on a quantum computer. First, we prove that even on a quantum computer whose program counter exists in superposition, one cannot correctly realize control flow in quantum algorithms by lifting the classical conditional jump instruction to work in superposition. This theorem denies the ability to directly lift general abstractions for control flow such as the $\lambda$-calculus from classical to quantum programming. In response, we present the necessary and sufficient conditions for control flow to be correctly realizable on a quantum computer. We introduce the quantum control machine, an instruction set architecture featuring a conditional jump that is restricted to satisfy these conditions. We show how this design enables a developer to correctly express control flow in quantum algorithms using a program counter in place of logic gates.

Related papers

• Distributed Architecture for FPGA-based Superconducting Qubit Control [7.804530685405802]
  Quantum circuits utilizing real time feedback techniques are a powerful tool for NISQ-era quantum computing. We have developed a custom FPGA-based processor architecture for QubiC, an open source platform for superconducting qubit control. We will detail the design of both the processor and compiler stack, and demonstrate its capabilities with a quantum state teleportation experiment.
  arXiv  Detail & Related papers  (2024-04-23T17:47:31Z)
• Quantum control by the environment: Turing uncomputability, Optimization over Stiefel manifolds, Reachable sets, and Incoherent GRAPE [56.47577824219207]
  In many practical situations, the controlled quantum systems are open, interacting with the environment. In this note, we briefly review some results on control of open quantum systems using environment as a resource.
  arXiv  Detail & Related papers  (2024-03-20T10:09:13Z)
• Autonomous Quantum Processing Unit: What does it take to construct a self-contained model for quantum computation? [0.27309692684728604]
  A formalism for quantum Turing machines lifts this input-output feature into the quantum domain. We develop a framework that we dub the autonomous Quantum Processing Unit (aQPU) Using the theory of open quantum systems we are able to use the aQPU as a formalism to investigate relationships between the thermodynamics, complexity, speed and fidelity of a desired quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T19:00:02Z)
• Design Verification of the Quantum Control Stack [0.5089990359065384]
  The paper serves both as an introduction to quantum computing and to how classical device verification techniques can be employed there. Two main challenges in building a quantum control stack are generating precise deterministic-timing operations at the edge and scaled-out processing in the middle layer.
  arXiv  Detail & Related papers  (2023-10-08T16:51:48Z)
• 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)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Quandary: An open-source C++ package for high-performance optimal control of open quantum systems [0.0]
  Quantum optimal control can be used to shape the control pulses for realizing unitary and non-unitary transformations of quantum states. Most current software for quantum optimal control (e.g. Qutip or Krotov) is restricted to run on shared memory platforms. This paper gives an overview of the open-source code Quandary, which is designed to solve quantum control problems in larger open quantum systems.
  arXiv  Detail & Related papers  (2021-10-19T23:34:25Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum Accelerator Stack: A Research Roadmap [0.0]
  We present the idea of a quantum accelerator which contains the full stack of the layers of an accelerator. Qbits are defined as perfect qubits, implying they do not decohere and perform good quantum gate operations. The logic is expressed in the universal quantum-classical hybrid computation language developed in the group, called OpenQL.
  arXiv  Detail & Related papers  (2021-02-03T12:33:12Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Extending XACC for Quantum Optimal Control [70.19683407682642]
  Quantum computing vendors are beginning to open up application programming for direct pulse-level quantum control. We present an extension to the XACC system-level quantum-classical software framework. This extension enables the translation of digital quantum circuit representations to equivalent pulse sequences.
  arXiv  Detail & Related papers  (2020-06-04T13:13:55Z)

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.