Certified quantum supremacy in entanglement-assisted prepare-measure random-access-code

• URL: http://arxiv.org/abs/2607.10273v1
• Date: Sat, 11 Jul 2026 12:07:32 GMT
• Title: Certified quantum supremacy in entanglement-assisted prepare-measure random-access-code
• Abstract summary: 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$.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We develop a family of semi-device-independent (SDI) entanglement-assisted prepare-measure (PM) communication games involving two parties, within the $n\rightarrow l$ random-access code (RAC) framework where the sender Alice holds a n-bit string and communicates $l<n$ bits or qubits to the receiver Bob. In contrast to the standard quantum PMRAC, here the parties share a prior entanglement, and Alice applies quantum operations on her sub-system to encode her inputs and sends to Bob. We first consider the $4\rightarrow l$ entanglement-assisted PMRAC with $l=1$ and $2$ and derive the optimal quantum success probabilities using an elegant analytical technique. We demonstrate quantum supremacy over both classical RACs and conventional quantum PMRACs. Moreover, we exhibit that the optimal quantum advantage allows one to certify Alice's unitary operations. We then derive an upper bound on the quantum success probabilities for $5\rightarrow l$ entanglement-assisted PMRAC with $l=1,2$ and $3$. Further, we extend the demonstration of quantum advantage for $n\rightarrow n-2$ case where n is arbitrary.

Related papers

• Semi-device-independent self-testing of unitary operations [0.0]
  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.
  arXiv  Detail & Related papers  (2026-04-21T18:44:01Z)
• Quantum function secret sharing [0.8204624881820105]
  In this primitive, a classical dealer distributes a secret quantum circuit $C$ by providing shares to $p$ quantum parties.<n>The parties on an input state $ketpsi$ and a projection $Pi$, compute values $y_i$ that they then classically communicate back to the dealer.<n>We show that our scheme is only secure against single adversaries, and we show that if two parties collude, then they can break its security.
  arXiv  Detail & Related papers  (2025-01-31T07:16:54Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Quantum Symmetric Private Information Retrieval with Secure Storage and Eavesdroppers [32.97918488607827]
  We consider both the classical and quantum variations of $X$-secure, $E$-eavesdropped and $T$-colluding symmetric private information retrieval (SPIR) We first develop a scheme for classical $X$-secure, $E$-eavesdropped and $T$-colluding SPIR (XSETSPIR) based on a modified version of cross subspace alignment (CSA)
  arXiv  Detail & Related papers  (2023-08-21T17:30:38Z)
• Lattice-Based Quantum Advantage from Rotated Measurements [2.0249250133493195]
  We show a new technique that uses the entire range of qubit measurements from the $XY$-plane. We construct a one-round protocol for blind remote preparation of an arbitrary state on the $XY$-plane up to a Pauli-$Z$ correction.
  arXiv  Detail & Related papers  (2022-10-18T20:18:15Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• High-dimensional multi-input quantum random access codes and mutually unbiased bases [0.0]
  We present a general method to find the maximum success probability of $n(d)rightarrow1$ QRACs. Based on the analytical solution, we show the relationship between MUBs and $n(d)rightarrow1$ QRACs.
  arXiv  Detail & Related papers  (2021-11-17T03:53:39Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• 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)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Computational advantage from quantum superposition of multiple temporal orders of photonic gates [0.0]
  A control quantum system can coherently determine the order in which a target quantum system undergoes $N$ gate operations. We experimentally demonstrate the quantum $N$-switch with $N=4$ gates acting on a photonic-polarization qubit. This is the first observation of a quantum superposition of more than $N=2$ temporal orders.
  arXiv  Detail & Related papers  (2020-02-18T19:00:01Z)
• Communication Cost of Quantum Processes [49.281159740373326]
  A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer. An important problem is to determine the minimum amount of communication needed to specify the desired computation. We analyze the total amount of (classical and quantum) communication needed by a server in order to accurately execute a quantum process chosen by a client.
  arXiv  Detail & Related papers  (2020-02-17T08:51:42Z)

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.