Probabilistic one-time programs using quantum entanglement

• URL: http://arxiv.org/abs/2008.02294v1
• Date: Wed, 5 Aug 2020 18:02:56 GMT
• Title: Probabilistic one-time programs using quantum entanglement
• Authors: Marie-Christine Roehsner, Joshua A. Kettlewell, Joseph Fitzsimons and Philip Walther
• Abstract summary: We present an improved protocol for one-time programs that resolves major drawbacks of previous schemes. This results in four orders of magnitude higher count rates as well the ability to execute a program long after the quantum information exchange has taken place. We demonstrate our protocol over an underground fiber link between university buildings in downtown Vienna.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: It is well known that quantum technology allows for an unprecedented level of data and software protection for quantum computers as well as for quantum-assisted classical computers. To exploit these properties, probabilistic one-time programs have been developed, where the encoding of classical software in small quantum states enables computer programs that can be used only once. Such self-destructing one-time programs facilitate a variety of new applications reaching from software distribution to one-time delegation of signature authority. Whereas first proof-of-principle experiments demonstrated the feasibility of such schemes, the practical applications were limited due to the requirement of using the software on-the-fly combined with technological challenges due to the need for active optical switching and a large amount of classical communication. Here we present an improved protocol for one-time programs that resolves major drawbacks of previous schemes, by employing entangled qubit pairs. This results in four orders of magnitude higher count rates as well the ability to execute a program long after the quantum information exchange has taken place. We demonstrate our protocol over an underground fiber link between university buildings in downtown Vienna. Finally, together with our implementation of a one-time delegation of signature authority this emphasizes the compatibility of our scheme with prepare-and-measure quantum internet networks.

Related papers

• The Road to Hybrid Quantum Programs: Characterizing the Evolution from Classical to Hybrid Quantum Software [3.1240846678117546]
  Efforts to identify quantum candidate code fragments that can meaningfully execute on quantum machines primarily rely on static code analysis. This paper aims to systematically formalize the process of identifying quantum candidates and their proper encoding within classical programs.
  arXiv  Detail & Related papers  (2025-03-14T14:37:57Z)
• SeQUeNCe GUI: An Extensible User Interface for Discrete Event Quantum Network Simulations [55.2480439325792]
  SeQUeNCe is an open source simulator of quantum network communication. We implement a graphical user interface which maintains the core principles of SeQUeNCe.
  arXiv  Detail & Related papers  (2025-01-15T19:36:09Z)
• Quantum One-Time Protection of any Randomized Algorithm [0.03320194947871346]
  A quantum one-time token is a quantum state that permits a certain program to be evaluated exactly once. We propose a scheme for building quantum one-time tokens for any randomized classical program, which include generative AI models.
  arXiv  Detail & Related papers  (2024-11-05T18:00:29Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Advancing Hybrid Quantum-Classical Computation with Real-Time Execution [10.818632836746668]
  We describe a next-generation implementation of classical computation embedded within quantum programs. It enables the real-time calculation and adjustment of program variables based on the mid-circuit state of measured qubits.
  arXiv  Detail & Related papers  (2022-06-26T19:50:15Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• A P4 Data Plane for the Quantum Internet [68.97335984455059]
  A new -- quantum -- network stack will be needed to account for the fundamentally new properties of quantum entanglement. In the non-quantum world, programmable data planes have broken the pattern of ossification of the protocol stack. We demonstrate how we use P4$_16$ to explore abstractions and device architectures for quantum networks.
  arXiv  Detail & Related papers  (2020-10-21T19:37:23Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• Enhanced Quantum Key Distribution using Hybrid Channels and Natural Random Numbers [0.0]
  We propose three secure key distribution protocols based on a blend of classical and quantum channels. The proposed protocols exploits the property of quantum computers to generate natural random numbers that can be easily transmitted.
  arXiv  Detail & Related papers  (2020-07-28T15:14:59Z)

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.