Related papers: Generating the Kochen-Specker Sets with 36, 38 and…
In [1] we proved a strengthened Kochen-Specker theorem in 3 dimensions: non-contextual hidden variable (NCHV) models cannot reproduce all the quantum correlations of two compatible observables, which is a minimal requirement imposed on the…
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…
We give an algorithm allowing to construct bases of local unitary invariants of pure k-qubit states from the knowledge of polynomial covariants of the group of invertible local filtering operations. The simplest invariants obtained in this…
The number of two-qubit gates required to transform deterministically a three-qubit pure quantum state into another is discussed. We show that any state can be prepared from a product state using at most three CNOT gates, and that, starting…
The Kochen-Specker (KS) theorem is a corner-stone result in the foundations of quantum mechanics describing the fundamental difference between quantum theory and classical non-contextual theories. Recently specific substructures termed…
Consider the set $\{1,2,\ldots,3n\}$. We are interested in the number of partitions of this set into subsets of three elements each, where the sum of two of them equals the third. We give some criteria such a partition has to fulfill, which…
Quantum contextuality takes an important place amongst the concepts of quantum computing that bring an advantage over its classical counterpart. For a large class of contextuality proofs, aka. observable-based proofs of the Kochen-Specker…
A recent proposal to experimentally test quantum mechanics against noncontextual hidden-variable theories [Phys. Rev. Lett. 80, 1797 (1998)] is shown to be related with the smallest proof of the Kochen-Specker theorem currently known [Phys.…
Quantum contextuality is one of the fundamental notions in quantum mechanics. Proofs of the Kochen-Specker theorem and noncontextuality inequalities are two means for revealing the contextuality phenomenon in quantum mechanics. It has been…
Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a…
The Kochen-Specker theorem is a fundamental result in quantum foundations that has spawned massive interest since its inception. We show that within every Kochen-Specker graph, there exist interesting subgraphs which we term $01$-gadgets,…
Semi-device-independent (SDI) randomness generation protocols based on Kochen-Specker contextuality offer the attractive features of compact devices, high rates, and ease of experimental implementation over fully device-independent (DI)…
Randomness is a potential resource for cryptography, simulations and algorithms. Non-local correlations violating Bell's inequality certify the generation of bit strings whose randomness is guaranteed in a device-independent manner. We…
Quantum computing is in an era of limited resources. Current hardware lacks high fidelity gates, long coherence times, and the number of computational units required to perform meaningful computation. Contemporary quantum devices typically…
How to find universal sets quantum gates (gates whose composition can form any othergate within a given range) is an important part of the development of quantum computation science that has been explored in the past with success. However,…
We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably…
Employing five commuting sets of five-qubit observables, we propose specific 160-661 and 160-21 state proofs of the Bell-Kochen-Specker theorem that are also proofs of Bell's theorem. A histogram of the 'Hilbert-Schmidt' distances between…
Quantum computational supremacy arguments, which describe a way for a quantum computer to perform a task that cannot also be done by a classical computer, typically require some sort of computational assumption related to the limitations of…
Certain concrete "ontological models" for quantum mechanics (models in which measurement outcomes are deterministic and quantum states are equivalent to classical probability distributions over some space of `hidden variables') are…
A central result in the foundations of quantum mechanics is the Kochen-Specker theorem. In short, it states that quantum mechanics is in conflict with classical models in which the result of a measurement does not depend on which other…