PubMed Health⌕ Search

Biomedical subjects

Terry Rudolph

Publications and source records attributed to Terry Rudolph.

6 recordsLinked to original sources

Loss tolerance in one-way quantum computation via counterfactual error correction.

We introduce a scheme for fault tolerantly dealing with losses (or other "leakage" errors) in cluster state computation that can tolerate up to 50% qubit loss. This is achieved passively using an adaptive strategy of measurement--no coherent measurements or coherent correction is required. Since the scheme relies on inferring information about what would have been the outcome of a measurement had one been able to carry it out, we call this counterfactual error correction.

Journal Article↗

Resource-efficient linear optical quantum computation.

We introduce a scheme for linear optics quantum computation, that makes no use of teleported gates, and requires stable interferometry over only the coherence length of the photons. We achieve a much greater degree of efficiency and a simpler implementation than previous proposals. We follow the "cluster state" measurement based quantum computational approach, and show how cluster states may be efficiently generated from pairs of maximally polarization entangled photons using linear optical elements. We demonstrate the universality and usefulness of generic parity measurements, as well as introducing the use of redundant encoding of qubits to enable utilization of destructive measurements--both features of use in a more general context.

Journal Article↗

Realization of a photonic controlled-NOT 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 only the use of linear optics, an entangled ancillary pair of photons, and postselection. The techniques developed in our experiment are of significant importance for quantum information processing with linear optics.

Journal Article↗

Quantum communication complexity of establishing a shared reference frame.

We discuss the aligning of spatial reference frames from a quantum communication complexity perspective. This enables us to analyze multiple rounds of communication and give several simple examples demonstrating tradeoffs between the number of rounds and the type of communication. Using a distributed variant of a quantum computational algorithm, we 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. This protocol achieves a worst-case fidelity for the problem of "direction finding" that is asymptotically equivalent to the optimal average case fidelity achievable via a single forward communication of entangled states.

Journal Article↗

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.

Journal Article↗

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.

Journal Article↗