arXiv subjects

D. E. Browne

Publications and source records attributed to D. E. Browne.

13 recordsLinked to original sources

arXiv2022

Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code

We build on recent work by B. Brown (Sci. Adv. 6, eaay4929 (2020)) to develop and simulate an explicit recipe for a just-in-time decoding scheme in three 3D surface codes, which can be used to implement a transversal (non-Clifford) $\overline{CCZ}$ between three 2D surface codes in time linear in the code distance. We present a fully detailed set of bounded-height lattice slices through the 3D codes which retain the code distance and measurement-error detecting properties of the full 3D code and admit a dimension-jumping process which expands from/collapses to 2D surface codes supported on the boundaries of each slice. At each timestep of the procedure the slices agree on a common set of overlapping qubits on which $CCZ$ should be applied. We use these slices to simulate the performance of a simple JIT decoder against stochastic $X$ and measurement errors and find evidence for a threshold $p_c \sim 0.1\%$ in all three codes. We expect that this threshold could be improved by optimisation of the decoder.

quant-ph↗

arXiv2020

A Hierarchy of Anyon Models Realised by Twists in Stacked Surface Codes

Braiding defects in topological stabiliser codes can be used to fault-tolerantly implement logical operations. Twists are defects corresponding to the end-points of domain walls and are associated with symmetries of the anyon model of the code. We consider twists in multiple copies of the 2d surface code and identify necessary and sufficient conditions for considering these twists as anyons: namely that they must be self-inverse and that all charges which can be localised by the twist must be invariant under its associated symmetry. If both of these conditions are satisfied the twist and its set of localisable anyonic charges reproduce the behaviour of an anyonic model belonging to a hierarchy which generalises the Ising anyons. We show that the braiding of these twists results in either (tensor products of) the S gate or (tensor products of) the CZ gate. We also show that for any number of copies of the 2d surface code the application of H gates within a copy and CNOT gates between copies is sufficient to generate all possible twists.

quant-ph↗

arXiv2012

Quasideterministic realization of a universal quantum gate in a single scattering process

We show that a flying particle, such as an electron or a photon, scattering along a one-dimensional waveguide from a pair of static spin-1/2 centers, such as quantum dots, can implement a CZ gate (universal for quantum computation) between them. This occurs quasi-deterministically in a single scattering event, hence with no need for any post-selection or iteration, {and} without demanding the flying particle to bear any internal spin. We show that an easily matched hard-wall boundary condition along with the elastic nature of the process are key to such performances.

quant-ph↗

arXiv2011

Physical model for the generation of ideal resources in multipartite quantum networking

We propose a physical model for generating multipartite entangled states of spin-$s$ particles that have important applications in distributed quantum information processing. Our protocol is based on a process where mobile spins induce the interaction among remote scattering centers. As such, a major advantage lies on the management of stationary and well separated spins. Among the generable states, there is a class of $N$-qubit singlets allowing for optimal quantum telecloning in a scalable and controllable way. We also show how to prepare Aharonov, W and Greenberger-Horne-Zeilinger states.

quant-ph↗

arXiv2009

Measurement-based quantum computation

Quantum computation offers a promising new kind of information processing, where the non-classical features of quantum mechanics can be harnessed and exploited. A number of models of quantum computation exist, including the now well-studied quantum circuit model. Although these models have been shown to be formally equivalent, their underlying elementary concepts and the requirements for their practical realization can differ significantly. The new paradigm of measurement-based quantum computation, where the processing of quantum information takes place by rounds of simple measurements on qubits prepared in a highly entangled state, is particularly exciting in this regard. In this article we discuss a number of recent developments in measurement-based quantum computation in both fundamental and practical issues, in particular regarding the power of quantum computation, the protection against noise (fault tolerance) and steps toward experimental realization. Moreover, we highlight a number of surprising connections between this field and other branches of physics and mathematics.

quant-ph↗

arXiv2007

How good must single photon sources and detectors be for efficient linear optical quantum computation?

We present a scheme for linear optical quantum computation (LOQC) which is highly robust to imperfect single photon sources and inefficient detectors. In particular we show that if the product of the detector efficiency with the source efficiency is greater than 2/3, then efficient LOQC is possible. This threshold is many orders of magnitude more relaxed than those which could be inferred by application of standard results in fault tolerance. The result is achieved within the cluster state paradigm for quantum computation.

quant-ph↗

arXiv2007

Generalized Flow and Determinism in Measurement-based Quantum Computation

We extend the notion of quantum information flow defined by Danos and Kashefi for the one-way model and present a necessary and sufficient condition for the deterministic computation in this model. The generalized flow also applied in the extended model with measurements in the X-Y, X-Z and Y-Z planes. We apply both measurement calculus and the stabiliser formalism to derive our main theorem which for the first time gives a full characterization of the deterministic computation in the one-way model. We present several examples to show how our result improves over the traditional notion of flow, such as geometries (entanglement graph with input and output) with no flow but having generalized flow and we discuss how they lead to an optimal implementation of the unitaries. More importantly one can also obtain a better quantum computation depth with the generalized flow rather than with flow. We believe our characterization result is particularly essential for the study of the algorithms and complexity in the one-way model.

quant-ph↗

arXiv2006

On the experimental feasibility of continuous-variable optical entanglement distillation

Entanglement distillation aims at preparing highly entangled states out of a supply of weakly entangled pairs, using local devices and classical communication only. In this note we discuss the experimentally feasible schemes for optical continuous-variable entanglement distillation that have been presented in [D.E. Browne, J. Eisert, S. Scheel, and M.B. Plenio, Phys. Rev. A 67, 062320 (2003)] and [J. Eisert, D.E. Browne, S. Scheel, and M.B. Plenio, Annals of Physics (NY) 311, 431 (2004)]. We emphasize their versatility in particular with regards to the detection process and discuss the merits of the two proposed detection schemes, namely photo-detection and homodyne detection, in the light of experimental realizations of this idea becoming more and more feasible.

quant-ph↗

arXiv2004

Distillation of continuous-variable entanglement with optical means

We present an event-ready procedure that is capable of distilling Gaussian two-mode entangled states from a supply of weakly entangled states that have become mixed in a decoherence process. This procedure relies on passive optical elements and photon detectors distinguishing the presence and the absence of photons, but does not make use of photon counters. We identify fixed points of the iteration map, and discuss in detail its convergence properties. Necessary and sufficient criteria for the convergence to two-mode Gaussian states are presented. On the basis of various examples we discuss the performance of the procedure as far as the increase of the degree of entanglement and two-mode squeezing is concerned. Finally, we consider imperfect operations and outline the robustness of the scheme under non-unit detection efficiencies of the detectors. This analysis implies that the proposed protocol can be implemented with currently available technology and detector efficiencies.

quant-ph↗

arXiv2003

Robust creation of entanglement between ions in spatially separate cavities

We present a protocol that allows the generation of a maximally entangled state between individual atoms held in spatially separate cavities. Assuming perfect detectors and neglecting spontaneous emission from the atoms, the resulting idealized scheme is deterministic. Under more realistic conditions, when the the atom-cavity interaction departs from the strong coupling regime, and considering imperfect detectors, we show that the scheme is robust against experimental inefficiencies and yields probabilistic entanglement of very high fidelity.

quant-ph↗

arXiv2003

Driving non-Gaussian to Gaussian states with linear optics

We introduce a protocol that maps finite-dimensional pure input states onto approximately Gaussian states in an iterative procedure. This protocol can be used to distill highly entangled bi-partite Gaussian states from a supply of weakly entangled pure Gaussian states. The entire procedure requires only the use of passive optical elements and photon detectors that solely distinguish between the presence and absence of photons.

quant-ph↗

arXiv2003

Measurement-based quantum computation with cluster states

We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. We prove its universality, describe why its underlying computational model is different from the network model of quantum computation and relate quantum algorithms to mathematical graphs. Further we investigate the scaling of required resources and give a number of examples for circuits of practical interest such as the circuit for quantum Fourier transformation and for the quantum adder. Finally, we describe computation with clusters of finite size.

quant-ph↗

arXiv2002

Robust generation of entanglement between two cavities mediated by short interactions with an atom

Current methods of preparing maximally entangled states in the laboratory need an extremely accurate control of interaction times, requiring sophisticated experimental techniques. Here, we show that such precise control is not necessary when one utilizes short or weak interactions followed by measurements. We present a scheme for the probabilistic generation of Bell states in a pair of cavities, after each has interacted briefly with an atom. The advantage of this proposal, as compared to present schemes, is its low sensitivity to the exact values of experimental parameters such as atomic velocity and coupling strength, in fact, for a large range of parameters the fidelity of the Bell states generated remains close to unity.

quant-ph↗