Related papers: Kochen-Specker Algorithms for Qunits
A perfect strategy is one that allows the mutually in-communicated players of a nonlocal game to win every trial of the game. Perfect strategies are basic tools for some fundamental results in quantum computation and crucial resources for…
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…
Solving ground states of quantum many-body systems has been a long-standing problem in condensed matter physics. Here, we propose a new unsupervised machine learning algorithm to find the ground state of a general quantum many-body system…
Quantum signal processing (QSP) provides a representation of scalar polynomials of degree $d$ as products of matrices in $\mathrm{SU}(2)$, parameterized by $(d+1)$ real numbers known as phase factors. QSP is the mathematical foundation of…
Bell non-locality and Kochen-Specker (KS) contextuality are logically independent concepts, fuel different protocols with quantum vs classical advantage, and have distinct classical simulation costs. A natural question is what are the…
We present quantum algorithms for the estimation of n-time correlation functions, the local and non-local density of states, and dynamical linear response functions. These algorithms are all based on block-encodings - a versatile technique…
The Kochen-Specker theorem states that a 3-dimensional complex Euclidean space admits a finite configuration of projective lines such that the corresponding quantum observables (the orthogonal projectors) cannot be assigned with 0 and 1…
The question of a hidden variable interpretation of quantum contextuality in the Mermin-Peres square is considered. The Kochen-Specker theorem implies that quantum mechanics may be interpreted as a contextual hidden variable theory. It is…
This article delves into the concept of quantum contextuality, specifically focusing on proofs of the Kochen-Specker theorem obtained by assigning Pauli observables to hypergraph vertices satisfying a given commutation relation. The…
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…
We propose an SQP algorithm for mathematical programs with vanishing constraints which solves at each iteration a quadratic program with linear vanishing constraints. The algorithm is based on the newly developed concept of $\mathcal…
The Kochen-Specker theorem theoretically shows evidence of the incompatibility of noncontextual hidden variable theories with quantum mechanics. Quantum contextuality is a more general concept than quantum non-locality which is quite well…
Recently developed quantum algorithms address computational challenges in numerical analysis by performing linear algebra in Hilbert space. Such algorithms can produce a quantum state proportional to the solution of a $d$-dimensional system…
The Bell-Kochen-Specker theorem (BKS) theorem rules out realistic {\it non-contextual} theories by resorting to impossible assignments of rays among a selected set of maximal orthogonal bases. We investigate the geometrical structure of…
Using a quantum like algebraic formulation we give proof of Kochen-Specker theorem. We introduce new criteria in order to account for the contextual nature of measurements in quantum mechanics.
We use projection methods to construct (global) quantum states with prescribed reduced (marginal) states, and possibly with some special properties such as having specific eigenvalues, having specific rank and extreme von Neumann or Renyi…
This paper initiates the study of quantum computing within the constraints of using a polylogarithmic ($O(\log^k n), k\geq 1$) number of qubits and a polylogarithmic number of computation steps. The current research in the literature has…
The amplitude encoding of an arbitrary $n$-qubit state vector requires $\Omega(2^n)$ gate operations, owing to the exponential dimension of the Hilbert space. We can, however, form dimensionality-reduced representations of quantum states…
A `register' in quantum information processing -- is composition of k quantum systems, `qudits'. The dimensions of Hilbert spaces for one qudit and whole quantum register are d and d^k respectively, but we should have possibility to prepare…
We present a ``state-independent'' proof of the Bell-Kochen-Specker theorem using only 18 four-dimensional vectors, which is a record for this kind of proof. This set of vectors contains subsets which allow us to develop a…