Related papers: Variations on Quantum Adversary
The architecture of circuital quantum computers requires computing layers devoted to compiling high-level quantum algorithms into lower-level circuits of quantum gates. The general problem of quantum compiling is to approximate any unitary…
We generalize the problem of coin flipping to more than two outcomes and parties. We term this problem dice rolling, and study both its weak and strong variants. We prove by construction that in quantum settings (i) weak N-sided dice…
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…
Quantum Discord (QD) is a measure of the total quantum non-local correlations of a quantum system. The formalism of quantum discord has been applied to various two-qubit mixed states and it has been reported that there is a non-zero quantum…
Quantum machine learning (QML) continues to be an area of tremendous interest from research and industry. While QML models have been shown to be vulnerable to adversarial attacks much in the same manner as classical machine learning models,…
The weak converse coding theorems have been proved for the quantum source and channel. The results give the lower bound for capacity of source and the upper bound for capacity of channel. The monotonicity of mutual quantum information have…
A version of quantum Cram\'{e}r-Rao bound dictates that the covariance of any set of operators is bounded by a product of the derivatives of expectation values and the inverse of quantum metric. We elaborate that because quantum metric…
Quantum annealing is a promising paradigm for building practical quantum computers. Compared to other approaches, quantum annealing technology has been scaled up to a larger number of qubits. On the other hand, deep learning has been…
In quantum field theory it is generally known that the energy density may be negative at a given point in spacetime. A number of papers have shown that there is a restriction on this energy density which is called a quantum inequality (QI).…
There have been several upper bounds on the quantum capacity of the single-mode Gaussian channels with thermal noise, such as thermal attenuator and amplifier. We consider a class of attenuator and amplifier with more general noises,…
Quantum query complexity is typically characterized in terms of XOR queries |x,y> to |x,y+f(x)> or phase queries, which ensure that even queries to non-invertible functions are unitary. When querying a permutation, another natural model is…
We obtain an analytical lower bound of entanglement quantified by concurrence for arbitrary bipartite quantum states. It is shown that our bound is tight for some mixed states and is complementary to the previous known lower bounds. On the…
We derive a tight generalization bound for quantum machine learning that is applicable to a wide range of supervised tasks, data, and models. Our bound is both efficiently computable and free of big-O notation. Furthermore, we point out…
Nonrelativistic bound states are studied using an effective field theory. Large logarithms in the effective theory can be summed using the velocity renormalization group. For QED, one can determine the structure of the leading and…
Recall the classical hypothesis testing setting with two convex sets of probability distributions P and Q. One receives either n i.i.d. samples from a distribution p in P or from a distribution q in Q and wants to decide from which set the…
While a positive operator valued measure gives the probabilities in a quantum measurement, an instrument gives both the probabilities and the a posteriori states. By interpreting the instrument as a quantum channel and by using the…
Modern machine learning systems have been applied successfully to a variety of tasks in recent years but making such systems robust against adversarially chosen modifications of input instances seems to be a much harder problem. It is…
In a recent preprint by Deutsch et al. [1995] the authors suggest the possibility of polynomial approximability of arbitrary unitary operations on $n$ qubits by 2-qubit unitary operations. We address that comment by proving strong lower…
Quantum inequalities are bounds on negative time-averages of the energy density of a quantum field. They can be used to rule out exotic spacetimes in general relativity. We study quantum inequalities for a scalar field with a background…
We study randomized and quantum efficiency lower bounds in communication complexity. These arise from the study of zero-communication protocols in which players are allowed to abort. Our scenario is inspired by the physics setup of Bell…