Related papers: Kochen-Specker Algorithms for Qunits
The Kochen-Specker (KS) theorem is a fundamental result in quantum foundations that has spawned massive interest since its inception. We present state-independent non-contextuality inequalities with large violations, in particular, we…
This paper deals with the problem of the requirements for quantum systems that enable one to design efficient quantum algorithms. We rise the issue of the possibility to utilise the non-complete networks for algorithmic purposes. In…
Solving linear systems of equations is a frequently encountered problem in machine learning and optimisation. Given a matrix $A$ and a vector $\mathbf b$ the task is to find the vector $\mathbf x$ such that $A \mathbf x = \mathbf b$. We…
Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b, find a vector x such that Ax=b. We consider the case where one doesn't need…
We present a comprehensive study of stationary states in a coherent medium with a quadratic or Kerr nonlinearity in the presence of localized potentials in one dimension (1D) for both positive and negative signs of the nonlinear term, as…
We introduce stochastic and quantum finite-state transducers as computation-theoretic models of classical stochastic and quantum finitary processes. Formal process languages, representing the distribution over a process's behaviors, are…
We call Krawtchouk-Griffiths systems, or KG-systems, systems of multivariate polynomials orthogonal with respect to corresponding multinomial distributions. The original Krawtchouk polynomials are orthogonal with respect to a binomial…
We present a quantum algorithm that additively approximates the value of a tensor network to a certain scale. When combined with existing results, this provides a complete problem for quantum computation. The result is a simple new way of…
The Kochen-Specker theorem demonstrates that it is not possible to reproduce the predictions of quantum theory in terms of a hidden variable model where the hidden variables assign a value to every projector deterministically and…
Quantum algorithm is an algorithm for solving mathematical problems using quantum systems encoded as information, which is found to outperform classical algorithms in some specific cases. The objective of this study is to develop a quantum…
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…
Quantum dynamics can be analyzed via the structure of energy eigenstates. However, in the many-body setting, preparing eigenstates associated with finite temperatures requires time scaling exponentially with system size. In this work we…
Klee's Measure Problem (KMP) asks for the volume of the union of n axis-aligned boxes in d-space. Omitting logarithmic factors, the best algorithm has runtime O*(n^{d/2}) [Overmars,Yap'91]. There are faster algorithms known for several…
Quantum neural networks (QNNs), as currently formulated, are near-term quantum machine learning architectures that leverage parameterized quantum circuits with the aim of improving upon the performance of their classical counterparts. In…
Quantum machine learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure…
Recently Waegell and Aravind [J. Phys. A: Math. Theor. 45 (2012), 405301, 13 pages] have given a number of distinct sets of three-qubit observables, each furnishing a proof of the Kochen-Specker theorem. Here it is demonstrated that two of…
Quantum signal processing (QSP) and quantum singular value transformation (QSVT), have emerged as unifying frameworks in the context of quantum algorithm design. These techniques allow to carry out efficient polynomial transformations of…
Quantum algorithm, as compared to classical algorithm, plays a notable role in solving linear systems of equations with an exponential speedup. Here, we demonstrate a method for solving a particular system of equations by using the concept…
The Kochen-Specker theorem asserts the impossibility of assigning values to quantum quantities in a way that preserves functional relations between them. We construct a new type of valuation which is defined on all operators, and which…
This paper studies generalized semi-infinite programs (GSIPs) defined with polyhedral parameter sets. Assume these GSIPs are given by polynomials. We propose a new approach to solve them as a disjunctive program. This approach is based on…