Practical quantum tokens without quantum memories and experimental tests
- URL: http://arxiv.org/abs/2104.11717v4
- Date: Thu, 7 Apr 2022 12:41:24 GMT
- Title: Practical quantum tokens without quantum memories and experimental tests
- Authors: Adrian Kent, David Lowndes, Dami\'an Pital\'ua-Garc\'ia, and John
Rarity
- Abstract summary: '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.
- Score: 0.15749416770494706
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Unforgeable quantum money tokens were the first invention of quantum
information science, but remain technologically challenging as they require
quantum memories and/or long distance quantum communication. More recently,
virtual 'S-money' tokens were introduced. These are generated by quantum
cryptography, do not require quantum memories or long distance quantum
communication, and yet in principle guarantee many of the security advantages
of quantum money. Here, we describe implementations of S-money schemes with
off-the-shelf quantum key distribution technology, and analyse security in the
presence of noise, losses, and experimental imperfection. Our schemes satisfy
near instant validation without cross-checking. We show that, given standard
assumptions in mistrustful quantum cryptographic implementations,
unforgeability and user privacy could be guaranteed with attainable refinements
of our off-the-shelf setup. We discuss the possibilities for unconditionally
secure (assumption-free) implementations.
Related papers
- Quantum Indistinguishable Obfuscation via Quantum Circuit Equivalence [6.769315201275599]
Quantum computing solutions are increasingly deployed in commercial environments through delegated computing.
One of the most critical issues is to guarantee the confidentiality and proprietary of quantum implementations.
Since the proposal of general-purpose indistinguishability obfuscation (iO) and functional encryption schemes, iO has emerged as a seemingly versatile cryptography primitive.
arXiv Detail & Related papers (2024-11-19T07:37:24Z) - Experimental practical quantum tokens with transaction time advantage [22.906545445051876]
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.
arXiv Detail & Related papers (2024-08-23T13:42:00Z) - The curse of random quantum data [62.24825255497622]
We quantify the performances of quantum machine learning in the landscape of quantum data.
We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits.
Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
arXiv Detail & Related papers (2024-08-19T12:18:07Z) - 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) - Quantum integrated sensing and communication via entanglement [4.854937611943075]
We propose a novel quantum integrated sensing and communication protocol, which achieves quantum sensing under the Heisenberg limit.
We have theoretically proven its security against eavesdroppers.
arXiv Detail & Related papers (2024-04-12T09:17:43Z) - 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) - Unclonability and Quantum Cryptanalysis: From Foundations to
Applications [0.0]
Unclonability is a fundamental concept in quantum theory and one of the main non-classical properties of quantum information.
We introduce new notions of unclonability in the quantum world, namely quantum physical unclonability.
We discuss several applications of this new type of unclonability as a cryptographic resource for designing provably secure quantum protocols.
arXiv Detail & Related papers (2022-10-31T17:57:09Z) - 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) - 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) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - 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)
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.