Experimental practical quantum tokens with transaction time advantage

• URL: http://arxiv.org/abs/2408.13063v1
• Date: Fri, 23 Aug 2024 13:42:00 GMT
• Title: Experimental practical quantum tokens with transaction time advantage
• Authors: Yang-Fan Jiang, Adrian Kent, Damián Pitalúa-García, Xiaochen Yao, Xiaohan Chen, Jia Huang, George Cowperthwaite, Qibin Zheng, Hao Li, Lixing You, Yang Liu, Qiang Zhang, Jian-Wei Pan,
• Abstract summary: We report the first full experimental demonstration of quantum S-tokens, proven secure despite errors, losses and experimental imperfections. We demonstrate a transaction time advantage over intra-city 2.77 km and inter-city 60.54 km optical fibre networks, compared with optimal classical cross-checking schemes.
• Score: 22.906545445051876
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum money is the first invention in quantum information science, promising advantages over classical money by simultaneously achieving unforgeability, user privacy, and instant validation. However, standard quantum money relies on quantum memories and long-distance quantum communication, which are technologically extremely challenging. Quantum "S-money" tokens eliminate these technological requirements while preserving unforgeability, user privacy, and instant validation. Here, we report the first full experimental demonstration of quantum S-tokens, proven secure despite errors, losses and experimental imperfections. The heralded single-photon source with a high system efficiency of 88.24% protects against arbitrary multi-photon attacks arising from losses in the quantum token generation. Following short-range quantum communication, the token is stored, transacted, and verified using classical bits. We demonstrate a transaction time advantage over intra-city 2.77 km and inter-city 60.54 km optical fibre networks, compared with optimal classical cross-checking schemes. Our implementation demonstrates the practicality of quantum S-tokens for applications requiring high security, privacy and minimal transaction times, like financial trading and network control. It is also the first demonstration of a quantitative quantum time advantage in relativistic cryptography, showing the enhanced cryptographic power of simultaneously considering quantum and relativistic physics.

Related papers

• Cloud-based Semi-Quantum Money [8.252999068253603]
  In the 1970s, Wiesner introduced the concept of quantum money, where quantum states generated according to specific rules function as currency. Quantum computers capable of minting and preserving quantum money have not yet emerged. Existing quantum channels are not stable enough to support the efficient transmission of quantum states for quantum money.
  arXiv  Detail & Related papers  (2024-07-16T07:40:17Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• A Cryptographic Perspective on the Verifiability of Quantum Advantage [5.857929080874288]
  This paper investigates the verification of quantum advantage from a cryptographic perspective. We establish a strong connection between the verifiability of quantum advantage and cryptographic and complexity primitives. Our work shows that the quest for verifiable quantum advantages may lead to applications of quantum cryptography.
  arXiv  Detail & Related papers  (2023-10-23T00:31:51Z)
• Quantum Optical Memory for Entanglement Distribution [52.77024349608834]
  Entanglement of quantum states over long distances can empower quantum computing, quantum communications, and quantum sensing. Over the past two decades, quantum optical memories with high fidelity, high efficiencies, long storage times, and promising multiplexing capabilities have been developed.
  arXiv  Detail & Related papers  (2023-04-19T03:18:51Z)
• 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)
• Experimental quantum adversarial learning with programmable superconducting qubits [15.24718195264974]
  We show the first experimental demonstration of quantum adversarial learning with programmable superconducting qubits. Our results reveal experimentally a crucial vulnerability aspect of quantum learning systems under adversarial scenarios.
  arXiv  Detail & Related papers  (2022-04-04T18:00:00Z)
• Quantum Communication Using Semiconductor Quantum Dots [0.0]
  Review focuses on implementations of, and building blocks for, quantum communication using quantum-light sources based on epitaxial semiconductor quantum dots. Recent progress towards quantum-secured communication networks as well as building blocks thereof is summarized.
  arXiv  Detail & Related papers  (2021-08-31T14:32:34Z)
• 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)
• Practical quantum tokens without quantum memories and experimental tests [0.15749416770494706]
  'S-money' tokens do not require quantum memories or long distance quantum communication. We describe implementations of S-money schemes with off-the-shelf quantum key distribution technology. We show that, given standard assumptions in mistrustful quantum cryptographic implementations, unforgeability and user privacy could be guaranteed.
  arXiv  Detail & Related papers  (2021-04-23T17:03:33Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

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.