Shadow Tomography of Quantum States

We introduce the problem of *shadow tomography*: given an unknown $D$-dimensional quantum mixed state $\rho$, as well as known two-outcome measurements $E_{1},\ldots,E_{M}$, estimate the probability that $E_{i}$ accepts $\rho$, to within additive error $\varepsilon$, for each of the $M$ measurements. How many copies of $\rho$ are needed to achieve this, with high probability? Surprisingly, we give a procedure that solves the problem by measuring only $\widetilde{O}\left( \varepsilon^{-4}\cdot\log^{4} M\cdot\log D\right)$ copies. This means, for example, that we can learn the behavior of an arbitrary $n$-qubit state, on all accepting/rejecting circuits of some fixed polynomial size, by measuring only $n^{O\left( 1\right)}$ 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

Superdense coding of quantum states

We describe a method to non-obliviously communicate a 2l-qubit quantum state by physically transmitting l+o(l) qubits of communication, and by consuming l ebits of entanglement and some shared random bits. In the non-oblivious scenario, the sender has a classical description of the state to be communicated. Our method can be used to communicate states that are pure or entangled with the sender's system; l+o(l) and 3l+o(l) shared random bits are sufficient respectively.Comment: 5 pages, revtex

Entanglement-swapping boxes and their communication properties

We pose the fundamental question of communication properties of primitives irrespectively of their implementation. To illustrate the idea we introduce the concept of entanglement-swapping boxes, i.e. we consider any quantum operations which perform entanglement swapping, not necessarily via simple quantum teleportation. We ask a question about the properties of such boxes., i.e. what local operations and how much classical communication are needed to perform them. We also ask if any box which performs entanglement swapping can be used to establish classical communication. We show that each box needs at least two bits of classical communication to perform it. It is also shown that each box can be used for classical communication and, most importantly, that there exist boxes which allow to communicate at most one bit. Surprisingly we find basic irreversibility in the process of entanglement swapping with respect to its communication properties.Comment: Accepted for publication in Phys. Rev. A as a Rapid Communicatio

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

Improved magic states distillation for quantum universality

Given stabilizer operations and the ability to repeatedly prepare a single-qubit mixed state rho, can we do universal quantum computation? As motivation for this question, "magic state" distillation procedures can reduce the general fault-tolerance problem to that of performing fault-tolerant stabilizer circuits. We improve the procedures of Bravyi and Kitaev in the Hadamard "magic" direction of the Bloch sphere to achieve a sharp threshold between those rho allowing universal quantum computation, and those for which any calculation can be efficiently classically simulated. As a corollary, the ability to repeatedly prepare any pure state which is not a stabilizer state (e.g., any single-qubit pure state which is not a Pauli eigenstate), together with stabilizer operations, gives quantum universality. It remains open whether there is also a tight separation in the so-called T direction.Comment: 6 pages, 5 figure

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

An Introduction to Quantum Programming in Quipper

Quipper is a recently developed programming language for expressing quantum computations. This paper gives a brief tutorial introduction to the language, through a demonstration of how to make use of some of its key features. We illustrate many of Quipper's language features by developing a few well known examples of Quantum computation, including quantum teleportation, the quantum Fourier transform, and a quantum circuit for addition.Comment: 15 pages, RC201

Chemical Tuning of Positive and Negative Magnetoresistances, and Superconductivity in 1222-type Ruthenocuprates

High critical-temperature superconductivity and large (colossal) magnetoresistances are two important electronic conducting phenomena found in transition metal oxides. High-Tc materials have applications such as superconducting magnets for MRI and NMR, and magnetoresistive materials may find use in magnetic sensors and spintronic devices. Here we report chemical doping studies of RuSr2(R2-xCex)Cu2O10-d ruthenocuprates which show that a single oxide system can be tuned between superconductivity at high hole dopings and varied magnetoresistive properties at low doping levels. A robust variation of negative magnetoresistance with hole concentration is found in the RuSr2R1.8-xY0.2CexCu2O10-d series, while RuSr2R1.1Ce0.9Cu2O10-d materials show an unprecedented crossover from negative to positive magnetoresistance with rare earth (R) ion radius

Results of the ontology alignment evaluation initiative 2019

The Ontology Alignment Evaluation Initiative (OAEI) aims at comparing ontology matching systems on precisely defined test cases. These test cases can be based on ontologies of different levels of complexity (from simple thesauri to expressive OWL ontologies) and use different evaluation modalities (e.g., blind evaluation, open evaluation, or consensus). The OAEI 2019 campaign offered 11 tracks with 29 test cases, and was attended by 20 participants. This paper is an overall presentation of that campaign