Qurts: Automatic Quantum Uncomputation by Affine Types with Lifetime

• URL: http://arxiv.org/abs/2411.10835v1
• Date: Sat, 16 Nov 2024 16:34:08 GMT
• Title: Qurts: Automatic Quantum Uncomputation by Affine Types with Lifetime
• Authors: Kengo Hirata, Chris Heunen,
• Abstract summary: Uncomputation is a feature in quantum programming that allows the programmer to discard a value without losing quantum information. We extend the Rust type system to give a uniform framework for automatic uncomputation called Qurts.
• Score: 0.0
• License:
• Abstract: Uncomputation is a feature in quantum programming that allows the programmer to discard a value without losing quantum information, and that allows the compiler to reuse resources. Whereas quantum information has to be treated linearly by the type system, automatic uncomputation enables the programmer to treat it affinely to some extent. Automatic uncomputation requires a substructural type system between linear and affine, a subtlety that has only been captured by existing languages in an ad hoc way. We extend the Rust type system to the quantum setting to give a uniform framework for automatic uncomputation called Qurts (pronounced quartz). Specifically, we parameterise types by lifetimes, permitting them to be affine during their lifetime, while being restricted to linear use outside their lifetime. We also provide two operational semantics: one based on classical simulation, and one that does not depend on any specific uncomputation strategy.

Related papers

• Training Neural Networks as Recognizers of Formal Languages [87.06906286950438]
  Formal language theory pertains specifically to recognizers. It is common to instead use proxy tasks that are similar in only an informal sense. We correct this mismatch by training and evaluating neural networks directly as binary classifiers of strings.
  arXiv  Detail & Related papers  (2024-11-11T16:33:25Z)
• Hybrid Quantum-Classical Machine Learning with String Diagrams [49.1574468325115]
  This paper develops a formal framework for describing hybrid algorithms in terms of string diagrams. A notable feature of our string diagrams is the use of functor boxes, which correspond to a quantum-classical interfaces.
  arXiv  Detail & Related papers  (2024-07-04T06:37:16Z)
• Uncomputation in the Qrisp high-level Quantum Programming Framework [1.299941371793082]
  We describe the interface for automated generation of uncomputation circuits in our Qrisp framework. Our algorithm for synthesizing uncomputation circuits in Qrisp is based on an improved version of "Unqomp"
  arXiv  Detail & Related papers  (2023-07-21T08:21:03Z)
• QParallel: Explicit Parallelism for Programming Quantum Computers [62.10004571940546]
  We present a language extension for parallel quantum programming. QParallel removes ambiguities concerning parallelism in current quantum programming languages. We introduce a tool that guides programmers in the placement of parallel regions by identifying the subroutines that profit most from parallelization.
  arXiv  Detail & Related papers  (2022-10-07T16:35:16Z)
• Two-Unitary Decomposition Algorithm and Open Quantum System Simulation [0.17126708168238122]
  We propose a quantum two-unitary decomposition (TUD) algorithm to decompose a $d$-dimensional operator $A$ with non-zero singular values. The two unitaries can be deterministically implemented, thus requiring only a single call to the state preparation oracle for each. Since the TUD method can be used to implement non-unitary operators as only two unitaries, it also has potential applications in linear algebra and quantum machine learning.
  arXiv  Detail & Related papers  (2022-07-20T16:09:28Z)
• Qunity: A Unified Language for Quantum and Classical Computing (Extended Version) [3.5348690973777006]
  We introduce Qunity, a new quantum programming language. Qunity treats quantum computing as a natural generalization of classical computing. We show how Qunity can cleanly express several quantum algorithms.
  arXiv  Detail & Related papers  (2022-04-26T15:34:22Z)
• Extending C++ for Heterogeneous Quantum-Classical Computing [56.782064931823015]
  qcor is a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context. Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language manner.
  arXiv  Detail & Related papers  (2020-10-08T12:49:07Z)
• Quantum circuit design for universal distribution using a superposition of classical automata [2.4192504570921622]
  This circuit is able to accelerate the inference of algorithmic structures in data for discovering causal generative models. A classical exhaustive enumeration of all possible programs on the automata is shown for a couple of example cases. This is the first time, a superposition of classical automata is implemented on the circuit model of quantum computation.
  arXiv  Detail & Related papers  (2020-06-01T14:47:28Z)
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures [67.85032071273537]
  Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitionings which map quantum circuits to modular physical machines one time slice at a time.
  arXiv  Detail & Related papers  (2020-05-25T17:58:44Z)
• Linear Dependent Type Theory for Quantum Programming Languages [1.7166794984161973]
  Modern quantum programming languages integrate quantum resources and classical control. They must be linearly typed to reflect the no-cloning property of quantum resources. High-level and practical languages should also support quantum circuits as first-class citizens.
  arXiv  Detail & Related papers  (2020-04-28T13:11:06Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.