Quantum-randomized polarization of laser pulses derived from zero-point diamond motion.

Intrinsic randomness in quantum systems is a vital resource for cryptography and other quantum information protocols. To date, randomizing macroscopic polarization states requires randomness from an external source, which is then used to modulate the polarization e.g. for quantum key-distribution protocols. Here, we present a Raman-based device for directly generating laser pulses with quantum-randomized polarizations. We show that crystals of diamond lattice symmetry provide a unique operating point for which the Raman gain is isotropic, so that the spontaneous symmetry breaking initiated by the quantum-random zero-point motion determines the output polarization. Experimentally measured polarizations are demonstrated to be consistent with an independent and identical uniform distribution with an estimated quantum entropy rate of 3.8 bits/pulse.

Scalable boson sampling with time-bin encoding using a loop-based architecture.

We present an architecture for arbitrarily scalable boson sampling using two nested fiber loops. The architecture has fixed experimental complexity, irrespective of the size of the desired interferometer, whose scale is limited only by fiber and switch loss rates. The architecture employs time-bin encoding, whereby the incident photons form a pulse train, which enters the loops. Dynamically controlled loop coupling ratios allow the construction of the arbitrary linear optics interferometers required for boson sampling. The architecture employs only a single point of interference and may thus be easier to stabilize than other approaches. The scheme has polynomial complexity and could be realized using demonstrated present-day technologies.

Quantum information: source of triggered entangled photon pairs?

The realization of an entangled photon source will be of great importance in quantum information--for example, for quantum key distribution and quantum computation--and Stevenson et al. have described such a source. However, we show here that first, their source is not entangled; second, they use inappropriate entanglement indicators that rely on assumptions invalidated by their data; and third, their source has insignificant entanglement even after simulating subtraction of the significant quantity of background noise. We therefore find that the standard of proof required for a semiconductor source of triggered entangled photon pairs has not been met by Stevenson et al..

Quantum walks with encrypted data.

In the setting of networked computation, data security can be a significant concern. Here we consider the problem of allowing a server to remotely manipulate client supplied data, in such a way that both the information obtained by the client about the server's operation and the information obtained by the server about the client's data are significantly limited. We present a protocol for achieving such functionality in two closely related models of restricted quantum computation-the boson sampling and quantum walk models. Because of the limited technological requirements of the boson scattering model, small scale implementations of this technique are feasible with present-day technology.

Power and efficiency of a thermal engine with a coherent bath.

We consider a quantum engine driven by repeated weak interactions with a heat bath of identical three-level atoms. This model was first introduced by Scully et al. [Science 299, 862 (2003)SCIEAS0036-807510.1126/science.1078955], who showed that coherence between the energy-degenerate ground states serves as a thermodynamic resource that allows operation of a thermal cycle with a coherence-dependent thermalization temperature. We consider a similar engine out of the quasistatic limit and find that the ground-state coherence also determines the rate of thermalization, therefore increasing the output power and the engine efficiency only when the thermalization temperature is reduced; revealing a more nuanced perspective of coherence as a resource. This allows us to optimize the output power by adjusting the coherence and relative stroke durations.

Quantum random walks on congested lattices and the effect of dephasing.

We consider quantum random walks on congested lattices and contrast them to classical random walks. Congestion is modelled on lattices that contain static defects which reverse the walker's direction. We implement a dephasing process after each step which allows us to smoothly interpolate between classical and quantum random walks as well as study the effect of dephasing on the quantum walk. Our key results show that a quantum walker escapes a finite boundary dramatically faster than a classical walker and that this advantage remains in the presence of heavily congested lattices.

Engineering integrated photonics for heralded quantum gates.

Scaling up linear-optics quantum computing will require multi-photon gates which are compact, phase-stable, exhibit excellent quantum interference, and have success heralded by the detection of ancillary photons. We investigate the design, fabrication and characterisation of the optimal known gate scheme which meets these requirements: the Knill controlled-Z gate, implemented in integrated laser-written waveguide arrays. We show device performance to be less sensitive to phase variations in the circuit than to small deviations in the coupler reflectivity, which are expected given the tolerance values of the fabrication method. The mode fidelity is also shown to be less sensitive to reflectivity and phase errors than the process fidelity. Our best device achieves a fidelity of 0.931 ± 0.001 with the ideal 4 × 4 unitary circuit and a process fidelity of 0.680 ± 0.005 with the ideal computational-basis process.

Loss-tolerant optical qubits.

We present a linear optics quantum computation scheme that employs a new encoding approach that incrementally adds qubits and is tolerant to photon loss errors. The scheme employs a circuit model but uses techniques from cluster-state computation and achieves comparable resource usage. To illustrate our techniques we describe a quantum memory which is fault tolerant to photon loss.

Practical scheme for quantum computation with any two-qubit entangling gate.

Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not, are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. We present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this result for systems of arbitrary finite dimension has been provided by Brylinski and Brylinski; however, their proof relies on a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical.