1,449 research outputs found
Random and free observables saturate the Tsirelson bound for CHSH inequality
Maximal violation of the CHSH-Bell inequality is usually said to be a feature
of anticommuting observables. In this work we show that even random observables
exhibit near-maximal violations of the CHSH-Bell inequality. To do this, we use
the tools of free probability theory to analyze the commutators of large random
matrices. Along the way, we introduce the notion of "free observables" which
can be thought of as infinite-dimensional operators that reproduce the
statistics of random matrices as their dimension tends towards infinity. We
also study the fine-grained uncertainty of a sequence of free or random
observables, and use this to construct a steering inequality with a large
violation
Property testing of unitary operators
In this paper, we systematically study property testing of unitary operators.
We first introduce a distance measure that reflects the average difference
between unitary operators. Then we show that, with respect to this distance
measure, the orthogonal group, quantum juntas (i.e. unitary operators that only
nontrivially act on a few qubits of the system) and Clifford group can be all
efficiently tested. In fact, their testing algorithms have query complexities
independent of the system's size and have only one-sided error. Then we give an
algorithm that tests any finite subset of the unitary group, and demonstrate an
application of this algorithm to the permutation group. This algorithm also has
one-sided error and polynomial query complexity, but it is unknown whether it
can be efficiently implemented in general
The cryptographic power of misaligned reference frames
Suppose that Alice and Bob define their coordinate axes differently, and the
change of reference frame between them is given by a probability distribution
mu over SO(3). We show that this uncertainty of reference frame is of no use
for bit commitment when mu is uniformly distributed over a (sub)group of SO(3),
but other choices of mu can give rise to a partially or even asymptotically
secure bit commitment.Comment: 4 pages Latex; v2 has a new referenc
Supervised learning with quantum enhanced feature spaces
Machine learning and quantum computing are two technologies each with the
potential for altering how computation is performed to address previously
untenable problems. Kernel methods for machine learning are ubiquitous for
pattern recognition, with support vector machines (SVMs) being the most
well-known method for classification problems. However, there are limitations
to the successful solution to such problems when the feature space becomes
large, and the kernel functions become computationally expensive to estimate. A
core element to computational speed-ups afforded by quantum algorithms is the
exploitation of an exponentially large quantum state space through controllable
entanglement and interference. Here, we propose and experimentally implement
two novel methods on a superconducting processor. Both methods represent the
feature space of a classification problem by a quantum state, taking advantage
of the large dimensionality of quantum Hilbert space to obtain an enhanced
solution. One method, the quantum variational classifier builds on [1,2] and
operates through using a variational quantum circuit to classify a training set
in direct analogy to conventional SVMs. In the second, a quantum kernel
estimator, we estimate the kernel function and optimize the classifier
directly. The two methods present a new class of tools for exploring the
applications of noisy intermediate scale quantum computers [3] to machine
learning.Comment: Fixed typos, added figures and discussion about quantum error
mitigatio
Two-way quantum communication channels
We consider communication between two parties using a bipartite quantum
operation, which constitutes the most general quantum mechanical model of
two-party communication. We primarily focus on the simultaneous forward and
backward communication of classical messages. For the case in which the two
parties share unlimited prior entanglement, we give inner and outer bounds on
the achievable rate region that generalize classical results due to Shannon. In
particular, using a protocol of Bennett, Harrow, Leung, and Smolin, we give a
one-shot expression in terms of the Holevo information for the
entanglement-assisted one-way capacity of a two-way quantum channel. As
applications, we rederive two known additivity results for one-way channel
capacities: the entanglement-assisted capacity of a general one-way channel,
and the unassisted capacity of an entanglement-breaking one-way channel.Comment: 21 pages, 3 figure
Adaptive versus non-adaptive strategies for quantum channel discrimination
We provide a simple example that illustrates the advantage of adaptive over
non-adaptive strategies for quantum channel discrimination. In particular, we
give a pair of entanglement-breaking channels that can be perfectly
discriminated by means of an adaptive strategy that requires just two channel
evaluations, but for which no non-adaptive strategy can give a perfect
discrimination using any finite number of channel evaluations.Comment: 11 page
Symmetric coupling of four spin-1/2 systems
We address the non-binary coupling of identical angular momenta based upon
the representation theory for the symmetric group. A correspondence is pointed
out between the complete set of commuting operators and the
reference-frame-free subsystems. We provide a detailed analysis of the coupling
of three and four spin-1/2 systems and discuss a symmetric coupling of four
spin-1/2 systems.Comment: 20 pages, no figure
On Nonzero Kronecker Coefficients and their Consequences for Spectra
A triple of spectra (r^A, r^B, r^{AB}) is said to be admissible if there is a
density operator rho^{AB} with (Spec rho^A, Spec rho^B, Spec rho^{AB})=(r^A,
r^B, r^{AB}). How can we characterise such triples? It turns out that the
admissible spectral triples correspond to Young diagrams (mu, nu, lambda) with
nonzero Kronecker coefficient [M. Christandl and G. Mitchison, to appear in
Comm. Math. Phys., quant-ph/0409016; A. Klyachko, quant-ph/0409113]. This means
that the irreducible representation V_lambda is contained in the tensor product
of V_mu and V_nu. Here, we show that such triples form a finitely generated
semigroup, thereby resolving a conjecture of Klyachko. As a consequence we are
able to obtain stronger results than in [M. Ch. and G. M. op. cit.] and give a
complete information-theoretic proof of the correspondence between triples of
spectra and representations. Finally, we show that spectral triples form a
convex polytope.Comment: 13 page
Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
The Schur basis on n d-dimensional quantum systems is a generalization of the
total angular momentum basis that is useful for exploiting symmetry under
permutations or collective unitary rotations. We present efficient (size
poly(n,d,log(1/\epsilon)) for accuracy \epsilon) quantum circuits for the Schur
transform, which is the change of basis between the computational and the Schur
bases. These circuits are based on efficient circuits for the Clebsch-Gordan
transformation. We also present an efficient circuit for a limited version of
the Schur transform in which one needs only to project onto different Schur
subspaces. This second circuit is based on a generalization of phase estimation
to any nonabelian finite group for which there exists a fast quantum Fourier
transform.Comment: 4 pages, 3 figure
- …