Andrew M. Lance

Tripartite quantum state sharing

We demonstrate a multipartite protocol to securely distribute and reconstruct a quantum state. A secret quantum state is encoded into a tripartite entangled state and distributed to three players. By collaborating, any two of the three players can reconstruct the state, while individual players obtain nothing. We characterize this (2,3) threshold quantum state sharing scheme in terms of fidelity, signal transfer, and reconstruction noise. We demonstrate a fidelity averaged over all reconstruction permutations of 0.73+/-0.04, a level achievable only using quantum resources.

Quantum cryptography without switching

We propose a new coherent state quantum key distribution protocol that eliminates the need to randomly switch between measurement bases. This protocol provides significantly higher secret key rates with increased bandwidths than previous schemes that only make single quadrature measurements. It also offers the further advantage of simplicity compared to all previous protocols which, to date, have relied on switching.

Continuous-variable quantum-state sharing via quantum disentanglement

Quantum-state sharing is a protocol where perfect reconstruction of quantum states is achieved with incomplete or partial information in a multipartite quantum network. Quantum-state sharing allows for secure communication in a quantum network where partial information is lost or acquired by malicious parties. This protocol utilizes entanglement for the secret-state distribution and a class of quantum disentangling protocols for the state reconstruction. We demonstrate a quantum-state sharing protocol in which a tripartite entangled state is used to encode and distribute a secret state to three players. Any two of these players can collaborate to reconstruct the secret state, while individual players obtain no information. We investigate a number of quantum disentangling processes and experimentally demonstrate quantum-state reconstruction using two of these protocols. We experimentally measure a fidelity, averaged over all reconstruction permutations, of F=0.73 +/- 0.02. A result achievable only by using quantum resources.

Coherent-state quantum key distribution without random basis switching

The random switching of measurement bases is commonly assumed to be a necessary step of quantum key distribution protocols. In this paper we present a no-switching protocol and show that switching is not required for coherent-state continuous-variable quantum key distribution. Further, this protocol achieves higher information rates and a simpler experimental setup compared to previous protocols that rely on switching. We propose an optimal eavesdropping attack against this protocol, assuming individual Gaussian attacks. Finally, we investigate and compare the no-switching protocol applied to the original Bennett-Brassard 1984 scheme.

Experimental demonstration of post-selection-based continuous-variable quantum key distribution in the presence of Gaussian noise

In realistic continuous-variable quantum key distribution protocols, an eavesdropper may exploit the additional Gaussian noise generated during transmission to mask her presence. We present a theoretical framework for a post-selection-based protocol which explicitly takes into account excess Gaussian noise. We derive a quantitative expression of the secret key rates based on the Levitin and Holevo bounds. We experimentally demonstrate that the post-selection-based scheme is still secure against both individual and collective Gaussian attacks in the presence of this excess noise.

Continuous variable (2, 3) threshold quantum secret sharing schemes

We present two schemes to perform continuous variable (2, 3) threshold quantum secret sharing (QSS) on the quadrature amplitudes of bright light beams. Both schemes require a pair of entangled light beams. The first scheme utilizes two phase sensitive optical amplifiers, whilst the second uses an electro-optic feedforward loop for the reconstruction of the secret. We examine the efficacy of QSS in terms of fidelity, as well as the signal transfer coefficients and the conditional variances of the reconstructed output state. We show that both schemes in the ideal case yield perfect secret reconstruction.

Quantum-state engineering with continuous-variable postselection

We present a scheme to conditionally engineer an optical quantum system via continuous-variable measurements. This scheme yields high-fidelity squeezed single photons and a superposition of coherent states, from input single- and two-photon Fock states, respectively. The input Fock state is interacted with an ancilla squeezed vacuum state using a beam splitter. We transform the quantum system by postselecting on the continuous-observable measurement outcome of the ancilla state. We experimentally demonstrate the principles of this scheme using coherent states and experimentally measure fidelities that are only achievable using quantum resources.

Conditional quantum-state engineering using ancillary squeezed-vacuum states

We investigate an optical scheme to conditionally engineer quantum states using a beam splitter, homodyne detection, and a squeezed vacuum as an ancillar state. This scheme is efficient in producing non-Gaussian quantum states such as squeezed single photons and superpositions of coherent states (SCSs). We show that a SCS with well defined parity and high fidelity can be generated from a Fock state of n <= 4, and conjecture that this can be generalized for an arbitrary n Fock state. We describe our experimental demonstration of this scheme using coherent input states and measuring experimental fidelities that are only achievable using quantum resources.

Maximization of Extractable Randomness in a Quantum Random-Number Generator

The generation of random numbers via quantum processes is an efficient and reliable method to obtain true indeterministic random numbers that are of vital importance to cryptographic communication and large-scale computer modeling. However, in realistic scenarios, the raw output of a quantum random-number generator is inevitably tainted by classical technical noise. The integrity of the device can be compromised if this noise is tampered with, or even controlled by some malicious party. To safeguard against this, we propose and experimentally demonstrate an approach that produces side-information independent randomness that is quantified by min-entropy conditioned on this classical noise. We present a method for maximizing the conditional min-entropy of the number sequence generated from a given quantum-to-classical-noise ratio. The detected photocurrent in our experiment is shown to have a real-time random-number generation rate of 14 (Mbit/s)/MHz. The spectral response of the detection system shows the potential to deliver more than 70 Gbit/s of random numbers in our experimental setup.

On the problem of non-zero word error rates for fixed-rate error correction codes in continuous variable quantum key distribution

The maximum operational range of continuous variable quantum key distribution protocols has shown to be improved by employing high-efficiency forward error correction codes. Typically, the secret key rate model for such protocols is modified to account for the non-zero word error rate of such codes. In this paper, we demonstrate that this model is incorrect: Firstly, we show by example that fixed-rate error correction codes, as currently defined, can exhibit efficiencies greater than unity. Secondly, we show that using this secret key model combined with greater than unity efficiency codes, implies that it is possible to achieve a positive secret key over an entanglement breaking channel - an impossible scenario. We then consider the secret key model from a post-selection perspective, and examine the implications for key rate if we constrain the forward error correction codes to operate at low word error rates.