Related papers: Quantum-to-Quantum Bernoulli Factory
The counterfeit coin problem requires us to find all false coins from a given bunch of coins using a balance scale. We assume that the balance scale gives us only ``balanced'' or ``tilted'' information and that we know the number k of false…
Quantum magic is a necessary resource for quantum computers to be not efficiently simulable by classical computers. Previous results have linked the amount of quantum magic, characterized by the number of $T$ gates or stabilizer rank, to…
Special stochastic representation of the wave function in Quantum Mechanics (QM), based on soliton realization of extended particles, is suggested with the aim to model quantum states via classical computer. Entangled solitons construction…
We discuss how to simulate simple quantum logic operations with a large number of qubits. These simulations are needed for experimental testing of scalable solid-state quantum computers. Quantum logic for remote qubits is simulated in a…
A Quantum Computer is a new type of computer which can efficiently solve complex problems such as prime factorization. A quantum computer threatens the security of public key encryption systems because these systems rely on the fact that…
Suppose that we are given a quantum computer programmed ready to perform a computation if it is switched on. Counterfactual computation is a process by which the result of the computation may be learnt without actually running the computer.…
We present a quantum-like (QL) model in that contexts (complexes of e.g. mental, social, biological, economic or even political conditions) are represented by complex probability amplitudes. This approach gives the possibility to apply the…
This paper positively solves the quantum subroutine problem for fully quantum oracles. The quantum subroutine problem asks whether a quantum computer with an efficiently computable oracle can be efficiently simulated by a non-oracle quantum…
One can fix the randomness used by a randomized algorithm, but there is no analogous notion of fixing the quantumness used by a quantum algorithm. Underscoring this fundamental difference, we show that, in the black-box setting, the…
We study the power of quantum fingerprints in the simultaneous message passing (SMP) setting of communication complexity. Yao recently showed how to simulate, with exponential overhead, classical shared-randomness SMP protocols by means of…
Quantum backflow is a counterintuitive effect in which the probability density of a free particle moves in the direction opposite to the particle's momentum. If the particle is electrically charged, then the effect can be viewed as the…
Conventionally the total correlations within a quantum system are quantified through distance-based expressions such as the relative entropy or the square-norm. Those expressions imply that a quantum state can contain both classical and…
We develop a technique for single qubit quantum state tomography using the mathematical setup of generalized quantization scheme for games. In our technique Alice sends an unknown pure quantum state to Bob who appends it with |0><0| and…
Gamification of quantum theory can provide new inroads into the subject: by allowing users to experience simulated worlds that manifest obvious quantum behaviors they can potentially build intuition for quantum phenomena. The Qubit Factory…
A quantum state is called concordant if it has zero quantum discord with respect to any part. By extension, a concordant computation is one such that the state of the computer, at each time step, is concordant. In this paper, I describe a…
A basic problem of approximation theory, the approximation of functions from the Sobolev space W_p^r([0,1]^d) in the norm of L_q([0,1]^d), is considered from the point of view of quantum computation. We determine the quantum query…
Testing the symmetries of quantum states and channels provides a way to assess their usefulness for different physical, computational, and communication tasks. Here, we establish several complexity-theoretic results that classify the…
Generation and manipulation of randomness is a relevant task for several applications of information technology. It has been shown that quantum mechanics offers some advantages for this type of task. A promising model for randomness…
We demonstrate that a high fidelity approximation to $| \Psi_b \rangle$, the quantum superposition over all bit strings within Hamming distance $b$ of the codewords of a dimension-$k$ linear code over $\mathbb{Z}_2^n$, can be efficiently…
In a quantum money scheme, a bank can issue money that users cannot counterfeit. Similar to bills of paper money, most quantum money schemes assign a unique serial number to each money state, thus potentially compromising the privacy of the…