Ensemble-Based Quantum-Token Protocol Benchmarked on IBM Quantum Processors

• URL: http://arxiv.org/abs/2412.08530v1
• Date: Wed, 11 Dec 2024 16:39:39 GMT
• Title: Ensemble-Based Quantum-Token Protocol Benchmarked on IBM Quantum Processors
• Authors: Lucas Tsunaki, Bernd Bauerhenne, Malwin Xibraku, Martin E. Garcia, Kilian Singer, Boris Naydenov,
• Abstract summary: Quantum tokens envision to store unclonable authentication keys in quantum states that are issued by a bank for example.<n>We propose an ensemble-based quantum-token protocol, making these applications technologically less-demanding.<n>We provide an open source tool with graphical user interface to benchmark the protocol with custom ensemble based qubits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Quantum tokens envision to store unclonable authentication keys in quantum states that are issued by a bank for example. In contrast to quantum communication, the information is not transmitted, but rather used for personal authentication in a physical device. Still, its experimental realization faces many technical challenges. In this work, we propose an ensemble-based quantum-token protocol, making these applications technologically less-demanding. A simple and minimal model is developed to describe the quantum token hardware, while the protocol is fully benchmarked and compared on five different IBM quantum processors. First, the uncertainties of the hardware are characterized, from which the main quality parameters that describe the token can be extracted. Following that, the fraction of qubits which the bank prepares and measures successfully is benchmarked. These fractions are then compared with the values obtained from an attacker who attempts to read the bank token and prepare a forged key. From which we experimentally demonstrate an acceptance probability of 0.057 for a forged token, in contrast to 0.999 for the bank's own tokens. These values can be further optimized by increasing the number of tokens in the device. Finally, we show that minor improvements in the hardware quality lead to significant increases in the protocol security, denoting a great potential of the protocol to scale with the ongoing quantum hardware evolution. We provide an open source tool with graphical user interface to benchmark the protocol with custom ensemble based qubits. This work demonstrates the overall security of the protocol within a hardware-agnostic framework, further confirming the interoperability of the protocol in arbitrary quantum systems and thus paving the way for future applications with different qubits.

Related papers

• Hybrid Authentication Protocols for Advanced Quantum Networks [0.6827423171182154]
  We introduce a new authentication approach that combines hardware assumptions, particularly Physical Unclonable Functions (PUFs), along with quantum properties of non-local states, such as local indistinguishability, to achieve provable security in entanglement-based protocols. These protocols are suitable for implementation across various platforms, particularly photonics-based ones, and offer a practical and flexible solution to the long-standing challenge of authentication in quantum communication networks.
  arXiv  Detail & Related papers  (2025-04-15T18:51:22Z)
• Advanced Attacks On Qubit-Ensemble Based Quantum Coins [0.0]
  Multiple differently tokens with ensembles are realizing a quantum coin that can be issued by a bank. A sophisticated attempt to copy the token can assume that measurements on sub-ensembles can be carried through. We prove that an arbitrary level of security can be obtained by adding an increasing amount of quantum tokens into a quantum coin.
  arXiv  Detail & Related papers  (2024-12-28T19:10:01Z)
• Quantum Homogenization as a Quantum Steady State Protocol on NISQ Hardware [42.52549987351643]
  Quantum homogenization is a reservoir-based quantum state approximation protocol.<n>We extend the standard quantum homogenization protocol to the dynamically-equivalent ($mathttSWAP$)$alpha$ formulation.<n>We show that our proposed protocol yields a completely positive, trace preserving (CPTP) map under which the code subspace is correctable.
  arXiv  Detail & Related papers  (2024-12-19T05:50:54Z)
• Sound certification of memory-bounded quantum computers [0.1874930567916036]
  We introduce an approach, which we call quantum system quizzing, for the certification of quantum gates in a practical server-user scenario.<n> Importantly, this approach does not require trusted state preparation and measurement and is thus inherently free from the associated systematic errors.<n>A major technical challenge that we are first to resolve in the memory-bounded single-device setup is recovering the tensor product structure of a multi-qubit system.
  arXiv  Detail & Related papers  (2024-11-06T19:23:45Z)
• On-Chip Verified Quantum Computation with an Ion-Trap Quantum Processing Unit [0.5497663232622965]
  We present and experimentally demonstrate a novel approach to verification and benchmarking of quantum computing. Unlike previous information-theoretically secure verification protocols, our approach is implemented entirely on-chip. Our results pave the way for more accessible and efficient verification and benchmarking strategies in near-term quantum devices.
  arXiv  Detail & Related papers  (2024-10-31T16:54:41Z)
• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a brand new quantum digital signature protocol without a trusted third party only with qubit technology to further improve the security. We prove that the protocol has information-theoretical unforgeability. Moreover, it satisfies other important secure properties, including asymmetry, undeniability, and expandability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• An Experimentally Validated Feasible Quantum Protocol for Identity-Based Signature with Application to Secure Email Communication [1.156080039774429]
  In 1984, Shamir developed the first Identity-based signature (IBS) to simplify public key infrastructure. IBS protocols rely on several theoretical assumption-based hard problems. Quantum cryptography (QC) is one such approach.
  arXiv  Detail & Related papers  (2024-03-27T04:32:41Z)
• Experimental Implementation of A Quantum Zero-Knowledge Proof for User Authentication [0.39845810840390733]
  A new interactive quantum zero-knowledge protocol for identity authentication is proposed and demonstrated. The protocol design involves a verifier and a prover knowing a pre-shared secret, and the acceptance or rejection of the proof is determined by the quantum bit error rate.
  arXiv  Detail & Related papers  (2024-01-17T19:00:00Z)
• A universal scheme to self-test any quantum state and extremal measurement [41.94295877935867]
  quantum network considered in this work is the simple star network, which is implementable using current technologies. For our purposes, we also construct a scheme that can be used to self-test the two-dimensional tomographically complete set of measurements with an arbitrary number of parties.
  arXiv  Detail & Related papers  (2023-12-07T16:20:28Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• 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)
• Certified randomness in tight space [28.7482666629286]
  We provide a method for certified randomness generation on a small-scale application-ready device. We demonstrate a 2-qubit photonic device that achieves the highest standard in randomness yet is cut out for real-world applications.
  arXiv  Detail & Related papers  (2023-01-09T17:34:48Z)
• Parallel remote state preparation for fully device-independent verifiable blind quantum computation [0.0]
  We introduce a device-independent two-prover scheme in which a classical verifier can use a simple quantum measurement device (the client device) to delegate a quantum computation to an untrusted quantum server.<n>We construct a parallel self-testing protocol to perform device-independent remote state preparation of $n$ qubits and compose this with the unconditionally secure universal verifiable blind quantum computation scheme of Fitzsimons and Kashefi (VBQC)<n>Our self-test achieves a multitude of desirable properties for the application we consider, giving rise to practical and fully device-independent VBQC.
  arXiv  Detail & Related papers  (2022-12-11T08:17:43Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• Secure multi-party quantum computation protocol for quantum circuits: the exploitation of triply-even quantum error-correcting codes [2.915868985330569]
  MPQC protocol is a cryptographic primitive allowing error-free distributed quantum computation. We suggest a modified MPQC protocol that adopts unconventional quantum error-correcting codes.
  arXiv  Detail & Related papers  (2022-06-10T04:43:11Z)
• 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)
• Benchmarking of Quantum Protocols [0.9176056742068812]
  We consider several quantum protocols that enable promising functionalities and services in near-future quantum networks. We use NetSquid simulation platform to evaluate the effect of various sources of noise on the performance of these protocols.
  arXiv  Detail & Related papers  (2021-11-03T21:17:04Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Efficient Quantum Digital Signatures without Symmetrization Step [7.848038078036641]
  Quantum digital signatures (QDS) exploit quantum laws to guarantee non-repudiation, unforgeability and transferability of messages. Current QDS protocols face two major restrictions, including the requirement of the symmetrization step. We present an efficient QDS protocol to overcome these issues by utilizing the classical post-processing operation called post-matching method.
  arXiv  Detail & Related papers  (2021-04-08T01:54:50Z)
• Anti-Forging Quantum Data: Cryptographic Verification of Quantum Computational Power [1.9737117321211988]
  Quantum cloud computing is emerging as a popular model for users to experience the power of quantum computing through the internet. How can users be sure that the output strings sent by the server are really from a quantum hardware?
  arXiv  Detail & Related papers  (2020-05-04T14:28: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.