On the cryptographic potential of single-qubit rotations

• URL: http://arxiv.org/abs/2606.23392v1
• Date: Mon, 22 Jun 2026 14:19:04 GMT
• Title: On the cryptographic potential of single-qubit rotations
• Abstract summary: We show how parties traditionally required to perform trusted qubit preparation or measurement can delegate these tasks to an untrusted provider.<n>A notable consequence of our results is the formal validation of the Qline as a versatile architecture capable of supporting a wide range of single-qubit protocols.
• Score: 0.2676349883103403
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the domain of quantum communication, cryptographic protocols often require users to have access to trusted qubit sources or detectors. Recently, it was shown that on an architecture called the Qline, several protocols can equivalently be performed by parties capable only of single-qubit rotations. In this work, we introduce two composably secure constructions that together show how in most quantum cryptographic protocols, parties traditionally required to perform trusted qubit preparation or measurement can delegate these tasks to an untrusted provider and instead rely on a trusted single-qubit rotation device. Our first construction implements single-qubit measurement and is universally applicable across any context. In contrast, our second construction, which addresses qubit preparation, relies on specific assumptions regarding the underlying protocol. We show, however, that these assumptions are inherently satisfied by the vast majority of common quantum cryptographic protocols. A notable consequence of our results is the formal validation of the Qline as a versatile architecture capable of supporting a wide range of single-qubit protocols.

Related papers

• Statistically-Secure Bit Commitment and Coin Flipping Protocols Based on Quantum Hardware Assumptions [0.0]
  We show that bit commitment, satisfying both hiding and binding, can be constructed from hybrid locked physical unclonable functions.<n>Our protocol uses these hardware assumptions in a novel and non-trivial way to achieve the first mistrustful two-party protocol.<n>Results suggest a new paradigm for secure two-party cryptography in quantum networks.
  arXiv  Detail & Related papers  (2026-08-11T17:45:59Z)
• Noise Inference by Recycling Test Rounds in Verification Protocols [0.3826963271075334]
  Interactive verification protocols for quantum computations allow to build trust between a client and a service provider.<n>We show that the repetition overhead of protocols with quantum communication can be further mitigated if one examines the task of operating a quantum machine from the service provider's point of view.
  arXiv  Detail & Related papers  (2026-03-31T17:15:20Z)
• Verifier-initiated quantum message-authentication via quantum zero-knowledge proofs [38.81686642226027]
  We introduce a new method where the verifier can request authentication only when needed, improving efficiency for quantum networks and blockchain applications.<n>Our approach adapts the concept of zero-knowledge widely used in classical cryptography to quantum settings, ensuring that verification reveals nothing about secret keys.<n>This work delivers the first general verifier-initiated quantum signature scheme with formal security, paving the way for scalable, secure authentication in future quantum infrastructures and decentralized systems.
  arXiv  Detail & Related papers  (2025-12-05T04:40:34Z)
• Roadmap to fault tolerant quantum computation using topological qubit arrays [36.987470905062736]
  We describe a device roadmap towards a fault-tolerant quantum computing architecture based on noise-resilient, topologically protected Majorana-based qubits.<n>Our roadmap encompasses four generations of devices: a single-qubit device that enables a measurement-based qubit benchmarking protocol; a two-qubit device that uses measurement-based braiding to perform single-qubit Clifford operations; and an eight-qubit device that can be used to show an improvement of a two-qubit operation when performed on logical qubits.
  arXiv  Detail & Related papers  (2025-02-17T19:00:10Z)
• Secure quantum bit commitment from separable operations [0.0]
  We show that imposing a restriction on the committing party to perform only separable operations enables secure quantum bit commitment schemes.<n>Specifically, we prove that in any perfectly hiding bit commitment protocol, an honestly-committing party limited to separable operations will be detected with high probability if they attempt to alter their commitment.
  arXiv  Detail & Related papers  (2025-01-13T14:15:11Z)
• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a novel quantum digital signature protocol without a trusted third-party.<n>We prove that the protocol has information-theoretical unforgeability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• Orthogonal-state-based Measurement Device Independent Quantum Communication [32.244698777387995]
  We propose a new protocol of measurement-device-independent quantum secure direct communication and quantum dialogue employing single basis, i.e., Bell basis as decoy qubits for eavesdropping detection. Our protocols leverage fundamentally distinct resources to close the security loopholes linked to measurement devices, while also effectively doubling the distance for secure direct message transmission.
  arXiv  Detail & Related papers  (2024-09-30T15:57:17Z)
• 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)
• Verification of Quantum Computations without Trusted Preparations or Measurements [0.6249768559720122]
  We present a modular, composable, and efficient way to turn known verification schemes into protocols that rely only on trusted gates. Our first contribution is an extremely lightweight reduction of the problem of quantum verification for BQP to the trusted application of single-qubit rotations around the Z axis and bit flips. The second construction shows that it is generally possible to information-theoretically verify arbitrary quantum computations with quantum output without trusted preparations or measurements.
  arXiv  Detail & Related papers  (2024-03-15T16:54:28Z)
• One-Time Universal Hashing Quantum Digital Signatures without Perfect Keys [24.240914319917053]
  We show that imperfect quantum keys with limited information leakage can be used for digital signatures and authentication without compromising security. This study significantly reduces the delay for data postprocessing and is compatible with any quantum key generation protocols.
  arXiv  Detail & Related papers  (2023-01-03T14:54:27Z)
• 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)
• Multi-party quantum fingerprinting with weak coherent pulses: circuit design and protocol analysis [0.0]
  We introduce a novel multi-user quantum fingerprinting protocol that is ready to be implemented with existing technology. Much of the importance of our work arises from the fact that the obtained QCC figures of merit allow direct comparison with the best-known classical multi-user fingerprinting protocol.
  arXiv  Detail & Related papers  (2020-06-01T04:28:52Z)

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.