相关论文: Hidden variable model for quantum computation with…
We show that every quantum computation can be described by Bayesian update of a probability distribution on a finite state space. When applied to the model of quantum computation with magic states, the size of this state space only depends…
In previously exhibited hidden variable models of quantum state preparation and measurement, the number of continuous hidden variables describing the actual state of a single realization is never smaller than the quantum state manifold…
We construct, for any finite dimension $n$, a new hidden measurement model for quantum mechanics based on representing quantum transition probabilities by the volume of regions in projective Hilbert space. For $n=2$ our model is equivalent…
We generalize Bell's hidden variable model describing the singlet state of a two-qubits system by extending it to arbitrary states and observables. As in the original work, we assume a uniform, state-independent probability distribution for…
We introduce the notion of hidden quantum correlations. We present the mean values of observables depending on one classical random variable described by the probability distribution in the form of correlation functions of two (three, etc.)…
It was shown by Bell that no local hidden variable model is compatible with quantum mechanics. If, instead, one permits the hidden variables to be entirely non-local, then any quantum mechanical predictions can be recovered. In this paper,…
We prove that the results of a finite set of general quantum measurements on an arbitrary dimensional quantum system can be simulated using a polynomial (in measurements) number of hidden-variable states. In the limit of infinitely many…
Classical information can be completely hidden in the correlations of bipartite quantum systems. However, it is impossible to hide or mask all quantum information according to the no-hiding and no-masking theorems derived recently. Here we…
We show that higher-dimensional versions of qubits, or qudits, can be encoded into spin systems and into harmonic oscillators, yielding important advantages for quantum computation. Whereas qubit-based quantum computation is adequate for…
We present a family of three-qubit quantum states with a basic local hidden variable model. Any von Neumann measurement can be described by a local model for these states. We show that some of these states are genuine three-partite…
We propose a method for classical simulation of finite-dimensional quantum systems, based on sampling from a quasiprobability distribution, i.e., a generalized Wigner function. Our construction applies to all finite dimensions, with the…
Every quantum physical system can be considered the ''shadow'' of a special kind of classical system. The system proposed here is classical mainly because each observable function has a well precise value on each state of the system: an…
Constructing local hidden variable (LHV) models for entangled quantum states is challenging, as the model should reproduce quantum predictions for all possible local measurements. Here we present a simple method for building LHV models,…
This paper initiates the study of hidden variables from the discrete, abstract perspective of quantum computing. For us, a hidden-variable theory is simply a way to convert a unitary matrix that maps one quantum state to another, into a…
We study a model of quantum computation based on the continuously-parameterized yet finite-dimensional Hilbert space of a spin system. We explore the computational powers of this model by analyzing a pilot problem we refer to as the close…
Encoding classical data into quantum states is considered a quantum feature map to map classical data into a quantum Hilbert space. This feature map provides opportunities to incorporate quantum advantages into machine learning algorithms…
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…
Using an algebraic framework we solve a problem posed in [5] and [7] about the axiomatizability of a quantum computational type logic related to fuzzy logic. A Hilbert-style calculus is developed obtaining an algebraic strong completeness…
Consumption of magic states promotes the stabilizer model of computation to universal quantum computation. Here, we propose three different classical algorithms for simulating such universal quantum circuits, and characterize them by…
An analog of classical "hidden variables" for qubit states is presented. The states of qubit (two-level atom, spin-1/2 particle) are mapped onto the states of three classical--like coins. The bijective map of the states corresponds to the…