Austin Peter Lund

Dr. Austin Peter Lund

1. Dahlem Center for Complex Quantum Systems, Freie Universität Berlin, 14195 Berlin, Germany
+1
orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 September 2014 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
Austin Peter LundAustin Peter Lund
Austin Peter Lund
ALA. Laing
A. Laing
SRS. Rahimi-Keshari
S. Rahimi-Keshari
TRT. Rudolph
T. Rudolph
JOJ. L. O’bRien
J. L. O’bRien
TRTim Ralph
Tim Ralph
We pose a randomized boson-sampling problem. Strong evidence exists that such a problem becomes intractable on a classical computer as a function of the number of bosons. We describe a quantum optical processor that can solve this problem efficiently based on a Gaussian input state, a linear optical network, and nonadaptive photon counting measurements. All the elements required to build such a processor currently exist. The demonstration of such a device would provide empirical evidence that quantum computers can, indeed, outperform classical computers and could lead to applications.

28 March 2010 in Nature Photonics
Verified
Journal Article
Closed access
PDF file
GXG. Y. Xiang
G. Y. Xiang
TRTim Ralph
Tim Ralph
Austin Peter LundAustin Peter Lund
Austin Peter Lund
NWN. Walk
N. Walk
GPG. J. Pryde
G. J. Pryde

25 January 2008 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
Austin Peter LundAustin Peter Lund
Austin Peter Lund
TRTim Ralph
Tim Ralph
HHH. L. Haselgrove
H. L. Haselgrove
Quantum computing using two coherent states as a qubit basis is a proposed alternative architecture with lower overheads but has been questioned as a practical way of performing quantum computing due to the fragility of diagonal states with large coherent amplitudes. We show that using error correction only small amplitudes (α>1.2) are required for fault-tolerant quantum computing. We study fault tolerance under the effects of small amplitudes and loss using a Monte Carlo simulation. The first encoding level resources are orders of magnitude lower than the best single photon scheme.

22 January 2025 in Nature
Verified
Journal Article
Open access
PDF file
HRH. Aghaee Rad
H. Aghaee Rad
TAT. Ainsworth
T. Ainsworth
RAR. N. Alexander
R. N. Alexander
BAB. Altieri
B. Altieri
MAM. F. Askarani
M. F. Askarani
YZY. Zhang
Y. Zhang
Photonics offers a promising platform for quantum computing1,2,3,4, owing to the availability of chip integration for mass-manufacturable modules, fibre optics for networking and room-temperature operation of most components. However, experimental demonstrations are needed of complete integrated systems comprising all basic functionalities for universal and fault-tolerant operation5. Here we construct a (sub-performant) scale model of a quantum computer using 35 photonic chips to demonstrate its functionality and feasibility. This combines all the primitive components as discrete, scalable rack-deployed modules networked over fibre-optic interconnects, including 84 squeezers6 and 36 photon-number-resolving detectors furnishing 12 physical qubit modes at each clock cycle. We use this machine, which we name Aurora, to synthesize a cluster state7 entangled across separate chips with 86.4 billion modes, and demonstrate its capability of implementing the foliated distance-2 repetition code with real-time decoding. The key building blocks needed for universality and fault tolerance are demonstrated: heralded synthesis of single-temporal-mode non-Gaussian resource states, real-time multiplexing actuated on photon-number-resolving detection, spatiotemporal cluster-state formation with fibre buffers, and adaptive measurements implemented using chip-integrated homodyne detectors with real-time single-clock-cycle feedforward. We also present a detailed analysis of our architecture’s tolerances for optical loss, which is the dominant and most challenging hurdle to crossing the fault-tolerant threshold. This work lays out the path to cross the fault-tolerant threshold and scale photonic quantum computers to the point of addressing useful applications.

13 April 2017 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
Austin Peter LundAustin Peter Lund
Austin Peter Lund
MBMichael J. Bremner
Michael J. Bremner
TRTim Ralph
Tim Ralph
There is a large body of evidence for the potential of greater computational power using information carriers that are quantum mechanical over those governed by the laws of classical mechanics. But the question of the exact nature of the power contributed by quantum mechanics remains only partially answered. Furthermore, there exists doubt over the practicality of achieving a large enough quantum computation that definitively demonstrates quantum supremacy. Recently the study of computational problems that produce samples from probability distributions has added to both our understanding of the power of quantum algorithms and lowered the requirements for demonstration of fast quantum algorithms. The proposed quantum sampling problems do not require a quantum computer capable of universal operations and also permit physically realistic errors in their operation. This is an encouraging step towards an experimental demonstration of quantum algorithmic supremacy. In this paper, we will review sampling problems and the arguments that have been used to deduce when sampling problems are hard for classical computers to simulate. Two classes of quantum sampling problems that demonstrate the supremacy of quantum algorithms are BosonSampling and Instantaneous Quantum Polynomial-time Sampling. We will present the details of these classes and recent experimental progress towards demonstrating quantum supremacy in BosonSampling.

17 August 2004 in Physical Review A
Verified
Journal Article
Open access
PDF file
Austin Peter LundAustin Peter Lund
Austin Peter Lund
HJH. Jeong
H. Jeong
TRTim Ralph
Tim Ralph
MKM. S. Kim
M. S. Kim
It is shown that a linear superposition of two macroscopically distinguishable optical coherent states can be generated using a single photon source and simple all-optical operations. Weak squeezing on a single photon, beam mixing with an auxiliary coherent state, and photon detecting with imperfect threshold detectors are enough to generate a coherent state superposition in a free propagating optical field with a large coherent amplitude (α>2) and high fidelity (F>0.99). In contrast to all previous schemes to generate such a state, our scheme does not need photon number resolving measurements nor Kerr-type nonlinear interactions. Furthermore, it is robust to detection inefficiency and exhibits some resilience to photon production inefficiency.