Semi-device-independent self-testing of unitary operations

• URL: http://arxiv.org/abs/2604.19911v1
• Date: Tue, 21 Apr 2026 18:44:01 GMT
• Title: Semi-device-independent self-testing of unitary operations
• Abstract summary: We consider a communication game involving two parties, Alice and Bob, who share a prior two-qubit quantum state.<n>Alice encodes her message by applying unitary operations on her subsystem and sends it to Bob.<n>We demonstrate that the optimal quantum advantage of the variant of $3$-bit PMRAC over the classical bound enables the self-testing of Alice's unitary operations and Bob's measurements.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a hitherto unexplored semi-device-independent (SDI) self-testing protocol designed to certify unitary operations within a variant of prepare-measure framework. We consider a communication game which we refer to as a variant of $3$-bit prepare-measure random access code (PMRAC) involving two parties, Alice and Bob, who share a prior two-qubit quantum state. Alice encodes her message by applying unitary operations on her subsystem and sends it to Bob. To decode the message, Bob performs a measurement on the whole system. We demonstrate that the optimal quantum advantage of the variant of $3$-bit PMRAC over the classical bound enables the self-testing of Alice's unitary operations and Bob's measurements. The derivation of the optimal quantum success probability is fully analytical. The approach is so elegant that it can be generalized for any arbitrary $n$-bit PMRAC and may also be extended to other prepare-measure communication games.

Related papers

• Certified quantum supremacy in entanglement-assisted prepare-measure random-access-code [0.0]
  We develop a family of semi-device-independent () entanglement-assisted prepare-measure (PM) communication games involving two parties.<n>In contrast to the standard quantum PMRAC, here the parties share a prior entanglement.<n>We derive an upper bound on the quantum success probabilities for $5rightarrow l$ entanglement-assisted PMRAC with $l=1,2$ and $3$.
  arXiv  Detail & Related papers  (2026-07-11T12:07:32Z)
• Quantum teleportation of cat states with binary-outcome measurements [4.231343305672911]
  We propose a teleportation protocol involving beam splitting operations and binary-outcome measurements.<n>These operations have a straightforward implementation using the dispersive regime of the Jaynes-Cummings Hamiltonian.<n>We discuss the optimal parameters in order to maximize the fidelity under a variety of scenarios.
  arXiv  Detail & Related papers  (2024-12-19T16:22:52Z)
• 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)
• Quantum advantage in a unified scenario and secure detection of resources [49.1574468325115]
  We consider a single communication task to study different approaches of observing quantum advantage.<n>In our task, there are three parties - the Manager, Alice, and Bob.<n>We show that the goal of the task can be achieved when Alice sends a qubit.
  arXiv  Detail & Related papers  (2023-09-22T23:06:20Z)
• Classical Cost of Transmitting a Qubit [0.0]
  We show that the statistics obtained in any quantum protocol can be simulated by the purely classical means of shared randomness and two bits of communication. In particular, two bits of communication are enough to simulate all quantum correlations associated to arbitrary local POVMs applied to any entangled two-qubit state.
  arXiv  Detail & Related papers  (2022-07-05T18:06:45Z)
• Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more [125.99533416395765]
  Many cryptographic primitives are two-party protocols, where one party, Bob, has full quantum computational capabilities, and the other party, Alice, is only required to send random BB84 states to Bob. We show how such protocols can generically be converted to ones where Alice is fully classical, assuming that Bob cannot efficiently solve the LWE problem. This means that all communication between (classical) Alice and (quantum) Bob is classical, yet they can still make use of cryptographic primitives that would be impossible if both parties were classical.
  arXiv  Detail & Related papers  (2022-01-31T18:56:31Z)
• Parallel self-testing of EPR pairs under computational assumptions [12.847847919343646]
  We show that a single EPR pair of a single quantum device can be self-tested under computational assumptions. We show that our protocol can be passed with probability negligibly close to $1$ by an honest quantum device. A simplified version of our protocol is the first that can efficiently certify an arbitrary number of qubits of a single cloud quantum computer.
  arXiv  Detail & Related papers  (2022-01-31T18:42:45Z)
• Quantum secure direct communication with private dense coding using general preshared quantum state [59.99354397281036]
  We study secure direct communication by using a general preshared quantum state and a generalization of dense coding. For a practical application, we propose a concrete protocol and derive an upper bound of information leakage.
  arXiv  Detail & Related papers  (2021-12-30T16:12:07Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum Computer Using Inherent Qubit Decoherence [53.20999552522241]
  We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems. We present three methods for implementing the thermal relaxation. We find excellent agreement between our results, experimental data, and the theoretical prediction.
  arXiv  Detail & Related papers  (2020-01-03T11:48:11Z)

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.