Related papers: On consistency of the quantum-like representation …
We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be…
The set equality problem is to tell whether two sets $A$ and $B$ are equal or disjoint under the promise that one of these is the case. This problem is related to the Graph Isomorphism problem. It was an open problem to find any $\omega(1)$…
We introduce the quantum implementation of a binary classifier based on cosine similarity between data vectors. The proposed quantum algorithm evaluates the classifier on a set of data vectors with time complexity that is logarithmic in the…
The enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum random walk (QRW) with the problem of data clustering, and develop two clustering algorithms based on the one…
We introduce the qubit representation by complex numbers on the set of Apollonius circles with common symmetric points at $0$ and $1$, related with $|0\rangle$ and $|1\rangle$ states. For one qubit states we find that the Shannon entropy as…
Modern experiments using nanoscale devices come ever closer to bridging the divide between the quantum and classical realms, bringing experimental tests of objective collapse theories that propose alterations to Schr\"{o}dinger's equation…
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…
We revise the problem of the quantization of relativistic particle models (spinless and spinning), presenting a modified consistent canonical scheme. One of the main point of the modification is related to a principally new realization of…
According to the theory of relativity and causality, a special type of correlation beyond quantum mechanics is possible in principle under the name of {\it non-local box}. The concept has been introduced from the principle of non-locality…
This work proposes a hybrid method (ULR) which integrates a rotation-equivariance-aware neural network and a low-rank structure to solve the two dimensional inverse medium scattering problem. The neural network is to model the data…
We model Monroe's and Chamberlin and Courant's multiwinner voting systems as a certain resource allocation problem. We show that for many restricted variants of this problem, under standard complexity-theoretic assumptions, there are no…
The auxiliary rules of quantum mechanics can be written without the Born rule by using what are called the nRules. The nRules are understood in part by making certain modifications in the Hamiltonian. In this paper, those modifications are…
The aim of the famous Born and Jordan 1925 paper was to put Heisenberg's matrix mechanics on a firm mathematical basis. Born and Jordan showed that if one wants to ensure energy conservation in Heisenberg's theory it is necessary and…
Zurek's derivation of Born's rule using envariance (invariance due to entanglement) is considered to capture the probability in full generality, but only as applied to measurement of a quantum observable. Contrariwise, textbook formulations…
We explain how the disparate kinematics of quantum mechanics (finite-dimensional Hilbert space of QM) and special relativity (Minkowski spacetime from the Lorentz transformations of SR) can both be based on one principle (relativity…
Answering an open question by Betzler et al. [Betzler et al., JAIR'13], we resolve the parameterized complexity of the multi-winner determination problem under two famous representation voting rules: the Chamberlin-Courant (in short CC)…
This work is an attempt to justify Born's rule within the framework of the many-minds interpretation seen as a development of the many-worlds interpretation of Everett. More precisely, here we develop a unitary model of many-minds based on…
We show that formulating the quantum time of arrival problem in a segment of the real line suggests rephrasing the quantum time of arrival problem to finding states that evolve to unitarily collapse at a given point at a definite time. For…
The probabilistic method is a technique for proving combinatorial existence results by means of showing that a randomly chosen object has the desired properties with positive probability. A particularly powerful probabilistic tool is the…
We study quantum algorithms working on classical probability distributions. We formulate four different models for accessing a classical probability distribution on a quantum computer, which are derived from previous work on the topic, and…