1,441 research outputs found
A Resource Framework for Quantum Shannon Theory
Quantum Shannon theory is loosely defined as a collection of coding theorems,
such as classical and quantum source compression, noisy channel coding
theorems, entanglement distillation, etc., which characterize asymptotic
properties of quantum and classical channels and states. In this paper we
advocate a unified approach to an important class of problems in quantum
Shannon theory, consisting of those that are bipartite, unidirectional and
memoryless.
We formalize two principles that have long been tacitly understood. First, we
describe how the Church of the larger Hilbert space allows us to move flexibly
between states, channels, ensembles and their purifications. Second, we
introduce finite and asymptotic (quantum) information processing resources as
the basic objects of quantum Shannon theory and recast the protocols used in
direct coding theorems as inequalities between resources. We develop the rules
of a resource calculus which allows us to manipulate and combine resource
inequalities. This framework simplifies many coding theorem proofs and provides
structural insights into the logical dependencies among coding theorems.
We review the above-mentioned basic coding results and show how a subset of
them can be unified into a family of related resource inequalities. Finally, we
use this family to find optimal trade-off curves for all protocols involving
one noisy quantum resource and two noiseless ones.Comment: 60 page
A family of quantum protocols
We introduce two dual, purely quantum protocols: for entanglement
distillation assisted by quantum communication (``mother'' protocol) and for
entanglement assisted quantum communication (``father'' protocol). We show how
a large class of ``children'' protocols (including many previously known ones)
can be derived from the two by direct application of teleportation or
super-dense coding. Furthermore, the parent may be recovered from most of the
children protocols by making them ``coherent''. We also summarize the various
resource trade-offs these protocols give rise to.Comment: 5 pages, 1 figur
How robust is a quantum gate in the presence of noise?
We define several quantitative measures of the robustness of a quantum gate
against noise. Exact analytic expressions for the robustness against
depolarizing noise are obtained for all unitary quantum gates, and it is found
that the controlled-not is the most robust two-qubit quantum gate, in the sense
that it is the quantum gate which can tolerate the most depolarizing noise and
still generate entanglement. Our results enable us to place several analytic
upper bounds on the value of the threshold for quantum computation, with the
best bound in the most pessimistic error model being 0.5.Comment: 14 page
Shadow Tomography of Quantum States
We introduce the problem of *shadow tomography*: given an unknown
-dimensional quantum mixed state , as well as known two-outcome
measurements , estimate the probability that
accepts , to within additive error , for each of the
measurements. How many copies of are needed to achieve this, with high
probability? Surprisingly, we give a procedure that solves the problem by
measuring only copies. This means, for example, that we can learn the behavior of an
arbitrary -qubit state, on all accepting/rejecting circuits of some fixed
polynomial size, by measuring only copies of the state.
This resolves an open problem of the author, which arose from his work on
private-key quantum money schemes, but which also has applications to quantum
copy-protected software, quantum advice, and quantum one-way communication.
Recently, building on this work, Brand\~ao et al. have given a different
approach to shadow tomography using semidefinite programming, which achieves a
savings in computation time.Comment: 29 pages, extended abstract appeared in Proceedings of STOC'2018,
revised to give slightly better upper bound (1/eps^4 rather than 1/eps^5) and
lower bounds with explicit dependence on the dimension
Instruction Set Architectures for Quantum Processing Units
Progress in quantum computing hardware raises questions about how these
devices can be controlled, programmed, and integrated with existing
computational workflows. We briefly describe several prominent quantum
computational models, their associated quantum processing units (QPUs), and the
adoption of these devices as accelerators within high-performance computing
systems. Emphasizing the interface to the QPU, we analyze instruction set
architectures based on reduced and complex instruction sets, i.e., RISC and
CISC architectures. We clarify the role of conventional constraints on memory
addressing and instruction widths within the quantum computing context.
Finally, we examine existing quantum computing platforms, including the D-Wave
2000Q and IBM Quantum Experience, within the context of future ISA development
and HPC needs.Comment: To be published in the proceedings in the International Super
Computing Conference 2017 publicatio
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
On the capacities of bipartite Hamiltonians and unitary gates
We consider interactions as bidirectional channels. We investigate the
capacities for interaction Hamiltonians and nonlocal unitary gates to generate
entanglement and transmit classical information. We give analytic expressions
for the entanglement generating capacity and entanglement-assisted one-way
classical communication capacity of interactions, and show that these
quantities are additive, so that the asymptotic capacities equal the
corresponding 1-shot capacities. We give general bounds on other capacities,
discuss some examples, and conclude with some open questions.Comment: V3: extensively rewritten. V4: a mistaken reference to a conjecture
by Kraus and Cirac [quant-ph/0011050] removed and a mistake in the order of
authors in Ref. [53] correcte
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
- …