Luke C. G. Govia

Luke C. G. Govia

Auto-generated profile, based on publicly available information

Luke C. G. Govia

Quantum Engineering and Computing, Raytheon BBN Technologies, Cambridge, Massachusetts 02138, USA

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
25 January 2021 in Physical Review Research
Verified
Journal Article
Open access
PDF file
LGL. C. G. Govia
L. C. G. Govia
GRG. J. Ribeill
G. J. Ribeill
GRG. E. Rowlands
G. E. Rowlands
HKH. K. Krovi
H. K. Krovi
TOT. A. Ohki
T. A. Ohki
Realizing the promise of quantum information processing remains a daunting task given the omnipresence of noise and error. Adapting noise-resilient classical computing modalities to quantum mechanics may be a viable path towards near-term applications in the noisy intermediate-scale quantum era. Here, we propose continuous variable quantum reservoir computing in a single nonlinear oscillator. Through numerical simulation of our model we demonstrate quantum-classical performance improvement and identify its likely source: the nonlinearity of quantum measurement. Beyond quantum reservoir computing, this result may impact the interpretation of results across quantum machine learning. We study how the performance of our quantum reservoir depends on Hilbert space dimension, how it is impacted by injected noise, and briefly comment on its experimental implementation. Our results show that quantum reservoir computing in a single nonlinear oscillator is an attractive modality for quantum computing on near-term hardware.

20 January 2022 in Physical Review Applied
Verified
Journal Article
Closed access
PDF file
BLBenjamin Lienhard
Benjamin Lienhard
AVAntti Vepsäläinen
Antti Vepsäläinen
LGLuke C.G. Govia
Luke C.G. Govia
CHCole R. Hoffer
Cole R. Hoffer
JQJack Y. Qiu
Jack Y. Qiu
WOWilliam D. Oliver
William D. Oliver
Demonstrating a quantum computational advantage will require high-fidelity control and readout of multiqubit systems. As system size increases, multiplexed qubit readout becomes a practical necessity to limit the growth of resource overhead. Many contemporary qubit-state discriminators presume single-qubit operating conditions or require considerable computational effort, limiting their potential extensibility. Here, we present multiqubit readout using neural networks as state discriminators. We compare our approach to contemporary methods employed on a quantum device with five superconducting qubits and frequency-multiplexed readout. We find that fully connected feedforward neural networks increase the qubit-state-assignment fidelity for our system. Relative to contemporary discriminators, the assignment error rate is reduced by up to 25% due to the compensation of system-dependent nonidealities such as readout crosstalk, which is reduced by up to one order of magnitude. Our work demonstrates a potentially extensible building block for high-fidelity readout relevant to both near-term devices and future fault-tolerant systems.

12 November 2020 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
PGPeter Groszkowski
Peter Groszkowski
HLHoi-Kwan Lau
Hoi-Kwan Lau
CLC. Leroux
C. Leroux
LGL. C. G. Govia
L. C. G. Govia
ACA. A. Clerk
A. A. Clerk
Spin-spin interactions generated by a detuned cavity are a standard mechanism for generating highly entangled spin squeezed states. We show here how introducing a weak detuned parametric (two-photon) drive on the cavity provides a powerful means for controlling the form of the induced interactions. Without a drive, the induced interactions cannot generate Heisenberg-limited spin squeezing, but a weak optimized drive gives rise to an ideal two-axis twist interaction and Heisenberg-limited squeezing. Parametric driving is also advantageous in regimes limited by dissipation, and enables an alternate adiabatic scheme which can prepare optimally squeezed, Dicke-like states. Our scheme is compatible with a number of platforms, including solid-state systems where spin ensembles are coupled to superconducting quantum circuits or mechanical modes.

18 December 2020 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
DBDarius Bunandar
Darius Bunandar
LGLuke C. G. Govia
Luke C. G. Govia
HKHari Krovi
Hari Krovi
DEDirk Englund
Dirk Englund
Quantum key distribution (QKD) allows for secure communications safe against attacks by quantum computers. QKD protocols are performed by sending a sizeable, but finite, number of quantum signals between the distant parties involved. Many QKD experiments, however, predict their achievable key rates using asymptotic formulas, which assume the transmission of an infinite number of signals, partly because QKD proofs with finite transmissions (and finite-key lengths) can be difficult. Here we develop a robust numerical approach for calculating the key rates for QKD protocols in the finite-key regime in terms of two semi-definite programs (SDPs). The first uses the relation between conditional smooth min-entropy and quantum relative entropy through the quantum asymptotic equipartition property, and the second uses the relation between the smooth min-entropy and quantum fidelity. The numerical programs are formulated under the assumption of collective attacks from the eavesdropper and can be promoted to withstand coherent attacks using the postselection technique. We then solve these SDPs using convex optimization solvers and obtain numerical calculations of finite-key rates for several protocols difficult to analyze analytically, such as BB84 with unequal detector efficiencies, B92, and twin-field QKD. Our numerical approach democratizes the composable security proofs for QKD protocols where the derived keys can be used as an input to another cryptosystem.

29 February 2024 in Physical Review Letters
Verified
Journal Article
Open access
PDF file
TTTed Thorbeck
Ted Thorbeck
ZXZhihao Xiao
Zhihao Xiao
AKArchana Kamal
Archana Kamal
LGLuke C. G. Govia
Luke C. G. Govia
It has long been known that the lifetimes of superconducting qubits suffer during readout, increasing readout errors. We show that this degradation is due to the anti-Zeno effect, as readout-induced dephasing broadens the qubit so that it overlaps “hot spots” of strong dissipation, likely due to two-level systems in the qubit’s bath. Using a flux-tunable qubit to probe the qubit’s frequency-dependent loss, we accurately predict the change in lifetime during readout with a new self-consistent master equation that incorporates the modification to qubit relaxation due to measurement-induced dephasing. Moreover, we controllably demonstrate both the Zeno and anti-Zeno effects, which can explain both suppression and the rarer enhancement of qubit lifetimes during readout.

21 August 2020 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
DRDiego Ristè
Diego Ristè
LGLuke C. G. Govia
Luke C. G. Govia
BDBrian Donovan
Brian Donovan
SFSpencer D. Fallek
Spencer D. Fallek
WKWilliam D. Kalfus
William D. Kalfus
TOThomas A. Ohki
Thomas A. Ohki
Although qubit coherence times and gate fidelities are continuously improving, logical encoding is essential to achieve fault tolerance in quantum computing. In most encoding schemes, correcting or tracking errors throughout the computation is necessary to implement a universal gate set without adding significant delays in the processor. Here, we realize a classical control architecture for the fast extraction of errors based on multiple cycles of stabilizer measurements and subsequent correction. We demonstrate its application on a minimal bit-flip code with five transmon qubits, showing that real-time decoding and correction based on multiple stabilizers is superior in both speed and fidelity to repeated correction based on individual cycles. Furthermore, the encoded qubit can be rapidly measured, thus enabling conditional operations that rely on feed forward, such as logical gates. This co-processing of classical and quantum information will be crucial in running a logical circuit at its full speed to outpace error accumulation.