Certification of three black boxes with unsharp measurements using $3 \rightarrow 1 $ sequential quantum random access codes

• URL: http://arxiv.org/abs/2103.03075v1
• Date: Thu, 4 Mar 2021 14:57:05 GMT
• Title: Certification of three black boxes with unsharp measurements using $3 \rightarrow 1 $ sequential quantum random access codes
• Abstract summary: We study a three-party prepare-transform-measure experiment with unsharp measurements based on $ 3 rightarrow 1 $ sequential random access codes (RACs) We derive optimal trade-off between the two correlation witnesses in $ 3 rightarrow 1 $ sequential quantum random access codes (QRACs) We find that classical correlation witness violation based on $3 rightarrow 1 $ sequential RACs cannot be obtained by both correlation witnesses simultaneously.
• Score: 3.967421455246713
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Unsharp measurements play an increasingly important role in quantum information theory. In this paper, we study a three-party prepare-transform-measure experiment with unsharp measurements based on $ 3 \rightarrow 1 $ sequential random access codes (RACs). We derive optimal trade-off between the two correlation witnesses in $ 3 \rightarrow 1 $ sequential quantum random access codes (QRACs), and use the result to complete the self-testing of quantum preparations, instruments and measurements for three sequential parties. We also give the upper and lower bounds of the sharpness parameter to complete the robustness analysis of the self-testing scheme. In addition, we find that classical correlation witness violation based on $3 \rightarrow 1 $ sequential RACs cannot be obtained by both correlation witnesses simultaneously. This means that if the second party uses strong unsharp measurements to overcome the classical upper bound, the third party cannot do so even with sharp measurements. Finally, we give the analysis and comparison of the random number generation efficiency under different sharpness parameters based on the determinant value, $2 \rightarrow 1 $ and $3 \rightarrow 1 $ QRACs separately. This letter sheds new light on generating random numbers among multi-party in semi-device independent framework.

Related papers

• Information capacity of quantum statistics: Fock-state tests of a discrete binary-sequence model on cloud photonic quantum processors [0.0]
  We show that commercial cloud photonic quantum processors have reached the precision required to bound a finite information capacity from below.<n>Data are split-invariant, excluding naive count composition at $8$ and confirming the interference-sign rule.<n>Cloud photonic processors are quantitative instruments for quantum foundations, and information capacity an experimentally boundable quantity.
  arXiv  Detail & Related papers  (2026-09-09T14:15:51Z)
• A Single Fixed Shallow Circuit for Classical Shadows of Arbitrary n-Qubit States [2.5735476569508995]
  We construct a single fixed shallow quantum analyzer whose Born outcomes replace externally sampled settings as labels for reusable shadow snapshots.<n>The analyzer combines a freshly prepared $n$-qubit fiducial register $A$ with parallel Bell readout of $A$ and the unknown system $S$, producing one $2n$-bit record per copy.
  arXiv  Detail & Related papers  (2026-09-07T04:36:39Z)
• Imbuing Large Language Models with Bidirectional Logic for Robust Chain Repair [44.80087038178069]
  We introduce Teleological Reasoning Infilling (TRI), a training framework that endows decoder-only transformers with a native emphgoal-conditioned bridging capability.<n>At inference, TRI operates as a surgical repair module within a dual-system loop.<n>Experiments on three benchmarks demonstrate that TRI achieves state-of-the-art performance across all tasks, while reducing per-problem token expenditure by 31.2%.
  arXiv  Detail & Related papers  (2026-06-03T15:58:48Z)
• $V_1$: Unifying Generation and Self-Verification for Parallel Reasoners [69.66089681814013]
  $V_$ is a framework that unifies generation and verification through efficient pairwise ranking.<n>$V_$-Infer improves Pass@1 by up to $10%$ over pointwise verification.<n>$V_$-PairRL achieves $7$--$9%$ test-time scaling gains over standard RL and pointwise joint training.
  arXiv  Detail & Related papers  (2026-03-04T17:22:16Z)
• Quantitative wave-particle duality in uniform multipath interferometers with symmetric which-path detector states [1.0896567381206717]
  A quantum system (quanton) traverses an interferometer with $N$ equally probable paths and interacts with another quantum system (detector) that stores path information in a set of correlations states.<n>We present entropic wave-particle duality relations between quantum coherence, characterized by the relative entropy of coherence of the quanton state, and which-path knowledge, quantified by the mutual information obtained through detector-state discrimination.
  arXiv  Detail & Related papers  (2026-01-19T14:19:06Z)
• Quantum sensor network metrology with bright solitons [39.58317527488534]
  General Heisenberg Limit (GHL) characterizes fundamental limitations for unknown parameter measurement and estimation accuracy.<n>Three-mode soliton Josephson junction (TMSJJ) system as a three mode extension for the soliton Josephson junction (SJJ) bosonic model.<n>Our findings open new prospects for quantum network sensorics with atomtronic circuits.
  arXiv  Detail & Related papers  (2025-07-21T08:01:36Z)
• Probabilistically Tightened Linear Relaxation-based Perturbation Analysis for Neural Network Verification [83.25968588249776]
  We present a novel framework that combines over-approximation techniques from LiRPA-based approaches with a sampling-based method to compute tight intermediate reachable sets.<n>With negligible computational overhead, $textttPT-LiRPA$ exploiting the estimated reachable sets, significantly tightens the lower and upper linear bounds of a neural network's output.
  arXiv  Detail & Related papers  (2025-07-07T18:45:53Z)
• Adversarial Quantum Machine Learning: An Information-Theoretic Generalization Analysis [39.889087719322184]
  We study the generalization properties of quantum classifiers adversarially trained against bounded-norm white-box attacks. We derive novel information-theoretic upper bounds on the generalization error of adversarially trained quantum classifiers.
  arXiv  Detail & Related papers  (2024-01-31T21:07:43Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• $\mathcal{PT}$-symmetric mapping of three states and its implementation on a cloud quantum processor [0.9599644507730107]
  We develop a new $mathcalPT$-symmetric approach for mapping three pure qubit states. We show consistency with the Hermitian case, conservation of average projections on reference vectors, and Quantum Fisher Information. Our work unlocks new doors for applying $mathcalPT$-symmetry in quantum communication, computing, and cryptography.
  arXiv  Detail & Related papers  (2023-12-27T18:51:33Z)
• Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
  We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
  arXiv  Detail & Related papers  (2022-11-07T12:00:45Z)
• Quantum computational finance: martingale asset pricing for incomplete markets [69.73491758935712]
  We show that a variety of quantum techniques can be applied to the pricing problem in finance. We discuss three different methods that are distinct from previous works.
  arXiv  Detail & Related papers  (2022-09-19T09:22:01Z)
• 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)
• Semi-device independent certification of multiple unsharpness parameters through sequential measurements [2.28438857884398]
  We provide semi-device independent self-testing protocols to certify multiple unsharpness parameters along with the states and the measurement settings. This is achieved through the sequential quantum advantage shared by multiple independent observers in a suitable communication game known as parity-oblivious random-access-code.
  arXiv  Detail & Related papers  (2021-12-29T14:07:18Z)
• 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)
• Distributed quantum inner product estimation [14.222887950206658]
  A benchmarking task known as cross-platform verification has been proposed that aims to estimate the fidelity of states prepared on two quantum computers. No quantum communication can be performed between the two physical platforms due to hardware constraints. We show that the sample complexity must be at least $Omega(max1/varepsilon2,sqrtd/varepsilon)$, even in the strongest setting.
  arXiv  Detail & Related papers  (2021-11-05T05:35:03Z)
• 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)
• Quantifying and controlling entanglement in the quantum magnet Cs$_2$CoCl$_4$ [0.0]
  We implement a model-independent measurement protocol for entanglement based on three entanglement witnesses: one-tangle, two-tangle, and quantum Fisher information (QFI) We perform high-resolution measurements on Cs$$ClCo$_4$, a close realization of the $S=1/2$ transverse-field XXZ spin chain. Our results lay the foundation for a general entanglement detection protocol for quantum spin systems.
  arXiv  Detail & Related papers  (2020-10-21T17:34:34Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• Estimation of pure states using three measurement bases [0.0]
  We introduce a new method to estimate unknown pure $d$-dimensional quantum states using the probability distributions associated with only three measurement bases. The viability of the protocol is experimentally demonstrated using two different and complementary high-dimensional quantum information platforms.
  arXiv  Detail & Related papers  (2020-06-05T03:28:51Z)

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.