Searcharxiv⌕ Search

arXiv subjects

Terry Rudolph

Publications and source records attributed to Terry Rudolph.

At least 109 records · Page 6Linked to original sources

Optimal measurements for relative quantum information

We provide optimal measurement schemes for estimating relative parameters of the quantum state of a pair of spin systems. We prove that the optimal measurements are joint measurements on the pair of systems, meaning that they cannot be achieved by local operations and classical communication. We also demonstrate that in the limit where one of the spins becomes macroscopic, our results reproduce those that are obtained by treating that spin as a classical reference direction.

quant-ph↗

Realization of a photonic CNOT gate sufficient for quantum computation

We report the first experimental demonstration of a quantum controlled-NOT gate for different photons, which is classically feed-forwardable. In the experiment, we achieved this goal with the use only of linear optics, an entangled ancillary pair of photons and post-selection. The techniques developed in our experiment will be of significant importance for quantum information processing with linear optics.

quant-ph↗

Photon-number superselection and the entangled coherent-state representation

We introduce the entangled coherent state representation, which provides a powerful technique for efficiently and elegantly describing and analyzing quantum optics sources and detectors while respecting the photon number superselection rule that is satisfied by all known quantum optics experiments. We apply the entangled coherent state representation to elucidate and resolve the longstanding puzzles of the coherence of a laser output field, interference between two number states, and dichotomous interpretations of quantum teleportation of coherent states.

quant-ph↗

Quantum state targeting

We introduce a new primitive for quantum communication that we term "state targeting" wherein the goal is to pass a test for a target state even though the system upon which the test is performed is submitted prior to learning the target state's identity. Success in state targeting can be described as having some control over the outcome of the test. We show that increasing one's control above a minimum amount implies an unavoidable increase in the probability of failing the test. This is analogous to the unavoidable disturbance to a quantum state that results from gaining information about its identity, and can be shown to be a purely quantum effect. We provide some applications of the results to the security analysis of cryptographic tasks implemented between remote antagonistic parties. Although we focus on weak coin flipping, the results are significant for other two-party protocols, such as strong coin flipping, partially binding and concealing bit commitment, and bit escrow. Furthermore, the results have significance not only for the traditional notion of security in cryptography, that of restricting a cheater's ability to bias the outcome of the protocol, but also on a novel notion of security that arises only in the quantum context, that of cheat-sensitivity. Finally, our analysis of state targeting leads to some interesting secondary results, for instance, a generalization of Uhlmann's theorem and an operational interpretation of the fidelity between two mixed states.

quant-ph↗

How significant are the known collision and element distinctness quantum algorithms?

Quantum search is a technique for searching N possibilities in only O(sqrt(N)) steps. It has been applied in the design of quantum algorithms for several structured problems. Many of these algorithms require significant amount of quantum hardware. In this paper we observe that if an algorithm requires O(P) hardware, it should be considered significant if and only if it produces a speedup of at least O(sqrt(P)) over a simple quantum search algorithm. This is because a speedup of $O(sqrt(P)) $ can be trivially obtained by dividing the search space into $O(P)$ separate parts and handing the problem to independent processors that do a quantum search. We argue that the known algorithms for collision and element distinctness fail to be non-trivial in this sense.

quant-ph↗

Classical and quantum communication without a shared reference frame

We show that communication without a shared reference frame is possible using entangled states. Both classical and quantum information can be communicated with perfect fidelity without a shared reference frame at a rate that asymptotically approaches one classical bit or one encoded qubit per transmitted qubit. We present an optical scheme to communicate classical bits without a shared reference frame using entangled photon pairs and linear optical Bell state measurements.

quant-ph↗

On the communication complexity of establishing a shared reference frame

We discuss the communication complexity of establishing a shared reference frame, in particular examining the case of aligning spatial axes via the exchange of spin-1/2 particles. Unlike previous work we allow for multiple rounds of communication, and we give several simple examples demonstrating that nontrivial tradeoffs between the number of rounds and the type of communication required exist. We then give an explicit protocol for aligning spatial axes via the exchange of spin-1/2 particles which makes no use of either exchanged entangled states or of joint measurements. Rather it works by performing a simple type of distributed quantum computation. To facilitate comparison with previous work, we show that this protocol achieves a worst case fidelity for the much studied problem of "direction finding" that is asymptotically equivalent (up to polylog factors) to the optimal average case fidelity achievable via a single forward communication of entangled states.

quant-ph↗

Quantum communication protocols using the vacuum

We speculate what quantum information protocols can be implemented between two accelerating observers using the vacuum. Whether it is in principle possible or not to implement a protocol depends on whether the aim is to end up with classical information or quantum information. Thus, unconditionally secure coin flipping seems possible but not teleportation.

quant-ph↗

Unambiguous discrimination of mixed states

We present the conditions under which probabilistic error-free discrimination of mixed states is possible, and provide upper and lower bounds on the maximum probability of success for the case of two mixed states. We solve certain special cases exactly, and demonstrate how the problems of state filtering and state comparison can be recast as problems of mixed state unambiguous discrimination.

quant-ph↗

Complete eigenstates of identical qubits arranged in regular polygons

We calculate the energy eigenvalues and eigenstates corresponding to coherent single and multiple excitations of an array of N identical qubits or two-level atoms (TLA's) arranged on the vertices of a regular polygon. We assume only that the coupling occurs via an exchange interaction which depends on the separation between the qubits. We include the interactions between all pairs of qubits, and our results are valid for arbitrary distances relative to the radiation wavelength. To illustrate the usefulness of these states, we plot the distance dependence of the decay rates of the n=2 (biexciton) eigenstates of an array of 4 qubits, and tabulate the biexciton eigenvalues and eigenstates, and absorption frequencies, line widths, and relative intensities for polygons consisting of N=2,...,9 qubits in the long-wavelength limit.

quant-ph↗

A quantum protocol for cheat-sensitive weak coin flipping

We present a quantum protocol for the task of weak coin flipping. We find that, for one choice of parameters in the protocol, the maximum probability of a dishonest party winning the coin flip if the other party is honest is 1/sqrt(2). We also show that if parties restrict themselves to strategies wherein they cannot be caught cheating, their maximum probability of winning can be even smaller. As such, the protocol offers additional security in the form of cheat sensitivity.

quant-ph↗

A 2 rebit gate universal for quantum computing

We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact 2-rebit) gate which is universal for quantum computing, although it cannot be used to perform arbitrary unitary transformations.

quant-ph↗

Quantum searching a classical database (or how we learned to stop worrying and love the bomb)

We show how to perform a quantum search for a classical object, specifically for a classical object which performs no coherent evolution on the quantum computer being used for the search. We do so by using interaction free measurement as a subroutine in a quantum search algorithm. In addition to providing a simple example of how non-unitary processes which approximate unitary ones can be useful in a quantum algorithm, our procedure requires only one photon regardless of the size of the database, thereby establishing an upper bound on the amount of energy required to search an arbitrarily large database. Alternatively, our result can be interpreted as showing how to perform an interaction free measurement with a single photon on an arbitrarily large number of possible bomb positions simultaneously. We also provide a simple example demonstrating that in terms of the number of database queries, the procedure outlined here can outperform the best classical one.

quant-ph↗

Constructing physically intuitive graph invariants

In this brief note I try to give a simple example of where physical intuition about a collection of interacting qubits can lead to the construction of "natural" versions of what are, generically, quite abstract mathematical objects - in this case graph invariants. This note is written primarily for physicists who do not want to go through the painful process of trying to understand Ed Witten's vastly more complicated construction of physically intuitive knot invariants, but who'd like some idea of how physical intuition can play a role in such things.

quant-ph↗

The Laws of Physics and Cryptographic Security

This paper consists of musings that originate mainly from conversations with other physicists, as together we've tried to learn some cryptography, but also from conversations with a couple of classical cryptographers. The main thrust of the paper is an attempt to explore the ramifications for cryptographic security of incorporating physics into our thinking at every level. I begin by discussing two fundamental cryptographic principles, namely that security must not rely on secrecy of the protocol and that our local environment must be secure, from a physical perspective. I go on to explain why by definition a particular cryptographic task, oblivious transfer, is inconsistent with a belief in the validity of quantum mechanics. More precisely, oblivious transfer defines states and operations that do not exist in any (complex) Hilbert space. I go on to argue the fallaciousness of a "black box" approach to quantum cryptography, in which classical cryptographers just trust physicists to provide them with secure quantum cryptographic sub-protocols, which they then attempt to incorporate into larger cryptographic systems. Lest quantum cryptographers begin to feel too smug, I discuss the fact that current implementations of quantum key distribution are only technologically secure, and not "unconditionally" secure as is sometimes claimed. I next examine the concept of a secure lab from a physical perspective, and end by making some observations about the cryptographic significance of the (often overlooked) necessity for parties who wish to communicate having established physical reference frames.

quant-ph↗

Comment on "The Quantum State of a Propagating Laser Field"

We comment on the theoretical quantum state of a propagating laser field proposed by van Enk and Fuchs [quant-ph/0104036, quant-ph/0111157] and clarify that the multimode description of the propagating laser field does not modify our analysis of continuous variable quantum teleportation [quant-ph/0103147]. Furthermore we point out that the ``complete measurements'' discussed by van Enk and Fuchs have not been achieved by existing technology and may not be possible even in principle.

quant-ph↗