Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userHybrid ququart-encoded quantum cryptography protected by Kochen-Specker contextuality
137
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Quantum cryptographic protocols based on complementarity are nonsecure against attacks in which complementarity is imitated with classical resources. The Kochen-Specker (KS) theorem provides protection against these attacks, without requiring entanglement or spatially separated composite systems. We analyze the maximum tolerated noise to guarantee the security of a KS-protected cryptographic scheme against these attacks, and describe a photonic realization of this scheme using hybrid ququarts defined by the polarization and orbital angular momentum of single photons.
rate research
Read More
In a recent work, it was shown by one of us (EGC) that Bell-Kochen-Specker inequality violations in phenomena satisfying the no-disturbance condition (a generalisation of the no-signalling condition) cannot in general be explained with a faithful classical causal model -- that is, a classical causal model that satisfies the assumption of no fine-tuning. The proof of that claim however was restricted to Bell scenarios involving 2 parties or Kochen-Specker-contextuality scenarios involving 2 measurements per context. Here we show that the result holds in the general case of arbitrary numbers of parties or measurements per context; it is not an artefact of the simplest scenarios. This result unifies, in full generality, Bell nonlocality and Kochen-Specker contextuality as violations of a fundamental principle of classical causality. We identify, however, an implicit assumption in the former proof, making it explicit here: that certain operational symmetries of the phenomenon are reflected in the model, rather than requiring fine-tuned choices of model parameters. This clarifies a subtle but important distinction between Bell nonlocality and Kochen-Specker contextuality.
We propose an experimental approach to {it macro}scopically test the Kochen-Specker theorem (KST) with superconducting qubits. This theorem, which has been experimentally tested with single photons or neutrons, concerns the conflict between the contextuality of quantum mechnaics (QM) and the noncontextuality of hidden-variable theories (HVTs). We first show that two Josephson charge qubits can be controllably coupled by using a two-level data bus produced by a Josephson phase qubit. Next, by introducing an approach to perform the expected joint quantum measurements of two separated Josephson qubits, we show that the proposed quantum circuits could demonstrate quantum contextuality by testing the KST at a macroscopic level.
Random numbers are required for a variety of applications from secure communications to Monte-Carlo simulation. Yet randomness is an asymptotic property and no output string generated by a physical device can be strictly proven to be random. We report an experimental realization of a quantum random number generator (QRNG) with randomness certified by quantum contextuality and the Kochen-Specker theorem. The certification is not performed in a device-independent way but through a rigorous theoretical proof of each outcome being value-indefinite even in the presence of experimental imperfections. The analysis of the generated data confirms the incomputable nature of our QRNG.
We introduce two generalizations of Kochen-Specker (KS) sets: projective KS sets and generalized KS sets. We then use projective KS sets to characterize all graphs for which the chromatic number is strictly larger than the quantum chromatic number. Here, the quantum chromatic number is defined via a nonlocal game based on graph coloring. We further show that from any graph with separation between these two quantities, one can construct a classical channel for which entanglement assistance increases the one-shot zero-error capacity. As an example, we exhibit a new family of classical channels with an exponential increase.
We present a hybrid scheme for quantum computation that combines the modular structure of elementary building blocks used in the circuit model with the advantages of a measurement-based approach to quantum computation. We show how to construct optimal resource states of minimal size to implement elementary building blocks for encoded quantum computation in a measurement-based way, including states for error correction and encoded gates. The performance of the scheme is determined by the quality of the resource states, where within this error model we find a threshold of the order of 10% local noise per particle for fault-tolerant quantum computation and quantum communication.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
