About

I am a Senior Research Scientist at AWS Center for Quantum Computing located in Pasadena, CA. I graduated from Yale in May of 2020 with a PhD in physics (you can find my thesis here). I specialize in bosonic quantum error correction and am interested in various other related fields such as fault-tolerant quantum computing, quantum communication theory, and quantum advantage. 

Email: noh827@gmail.com | Twitter: @kyungjoo_noh 

See below for my papers sorted by topics:

Recent updates

2021/07: Colored Kerr cat qubits

2021/07: AWS blog post on the surface-GKP code

2021/03: My PhD thesis is now available on arxiv

2021/03: Low overhead fault-tolerant quantum error correction with the surface-GKP code

2021/02: Recorded talk given at QIP 2021

2021/01: Accepted contributed talk at QIP 2021 

My work on energy-constrained Gaussian channel capacity is accepted for a contributed talk at QIP 2021

2020/12: Building a fault-tolerant quantum computer using concatenated cat codes

2020/11: Recorded talk given at Byron Bay Quantum Workshop 2020 

2020/08: Review paper on bosonic QEC

Research highlights

GKP-stabilizer codes [oscillator(s)-into-oscillators] (2020)

A longer version of this paper is available at https://arxiv.org/abs/1903.12615 and contains information not covered in the published version.

Accepted for a talk at QEC2019. 

Abstract for the talk is available here.   

Abstract

In many bosonic quantum error correction (QEC) schemes proposed so far, a finite-dimensional discrete-variable (DV) system (consisted of qubits) is encoded into an oscillator or into many oscillators. In such qubit(s)-into-oscillator(s) schemes, the bosonic nature of the physical oscillator modes is lost at the logical level because the error-corrected logical system is described by discrete quantum variables such as Pauli operators. Therefore, the error-corrected logical DV system is not itself tailored to continuous-variable (CV) quantum information processing tasks such as boson sampling. 

We propose a broad class of bosonic quantum error-correcting codes, GKP-stabilizer codes, that encode logical oscillator modes into physical oscillator modes. Our codes can correct Gaussian errors such as excitation losses, thermal noise and additive Gaussian noise errors. Since the bosonic nature of the physical modes is still retained at the logical level, our oscillator(s)-into-oscillators codes are tailored to CV quantum information processing tasks.     

In particular, we show that there exists a highly hardware-efficient GKP-stabilizer code, the GKP-two-mode-squeezing code (shown above), that can quadratically suppress additive Gaussian noise errors in both the position and momentum quadratures using only two bosonic modes (one data mode and one ancilla mode).  

Our codes are the first instances of oscillator(s)-into-oscillators codes that can correct Gaussian errors. Specifically, we circumvent the established no-go theorems that state Gaussian errors cannot be corrected by Gaussian QEC schemes, by using Gottesman-Kitaev-Preskill (GKP) states as non-Gaussian resources in our codes.   

One-dimensional noisy random circuit sampling (2020)

Abstract

Understanding the computational power of noisy intermediate-scale quantum (NISQ) devices is of both fundamental and practical importance to quantum information science. Here, we address the question of whether error-uncorrected noisy quantum computers can provide computational advantage over classical computers. Specifically, we study noisy random circuit sampling in one dimension (or 1D noisy RCS) as a simple model for exploring the effects of noise on the computational power of a noisy quantum device. In particular, we simulate the real-time dynamics of 1D noisy random quantum circuits via matrix product operators (MPOs) and characterize the computational power of the 1D noisy quantum system by using a metric we call MPO entanglement entropy. The latter metric is chosen because it determines the cost of classical MPO simulation. 

We numerically demonstrate that for the two-qubit gate error rates we considered, there exists a length scale above which adding more qubits does not bring about an exponential growth of the cost of classical MPO simulation of 1D noisy systems. Specifically, we show that above the length scale, there is an optimal circuit depth, independent of the system size, where the MPO entanglement entropy is maximized. Most importantly, the maximum achievable MPO entanglement entropy is bounded by a constant that depends only on the gate error rate, not on the system size. We also provide a heuristic analysis to get the scaling of the maximum achievable MPO entanglement entropy as a function of the gate error rate. The obtained scaling suggests that although the cost of MPO simulation does not increase exponentially in the system size above a certain length scale, it does increase exponentially as the gate error rate decreases, possibly making classical simulation practically not feasible even with a state-of-the-art supercomputer.

Fault-tolerant magic state preparation (2020)

Abstract

The overhead cost of performing universal fault-tolerant quantum computation for large scale quantum algorithms is very high. Despite several attempts at alternative schemes, magic state distillation remains one of the most efficient schemes for simulating non-Clifford gates in a fault-tolerant way. However, since magic state distillation circuits are not fault-tolerant, all Clifford operations must be encoded in a large distance code in order to have comparable failure rates with the magic states being distilled. 

In this work, we introduce a new concept which we call redundant ancilla encoding. The latter combined with flag qubits allows for circuits to both measure stabilizer generators of some code, while also being able to measure global operators to fault-tolerantly prepare magic states, all using nearest neighbor interactions. In particular, we apply such schemes to a planar architecture of the triangular color code family. In addition to our scheme being suitable for experimental implementations, we show that for physical error rates near 10^(-4) and under a full circuit-level noise model, our scheme can produce magic states using an order of magnitude fewer qubits and space-time overhead compared to the most competitive magic state distillation schemes. Further, we can take advantage of the fault-tolerance of our circuits to produce magic states with very low logical failure rates using encoded Clifford gates with noise rates comparable to the magic states being injected. Thus, stabilizer operations are not required to be encoded in a very large distance code. Consequently, we believe our scheme to be suitable for implementing fault-tolerant universal quantum computation with hardware currently under development.

The Surface-GKP code [qubit-into-oscillators] (2020)

Abstract

Various single-mode bosonic quantum error-correcting codes such as cat, binomial, and GKP codes have been implemented experimentally in circuit QED and trapped ion systems. Moreover, there have been many theoretical proposals to scale up such single-mode bosonic codes to realize large-scale fault-tolerant quantum computation. Here, we consider the concatenation of the single-mode GKP code with the surface code, namely, the surface-GKP code. In particular, we thoroughly investigate the performance of the surface-GKP code by assuming realistic GKP states with a finite squeezing and noisy circuit elements due to photon losses. 

By using a minimum-weight perfect matching decoding algorithm on a 3D space-time graph, we show that fault-tolerant quantum error correction is possible with the surface-GKP code if the squeezing of the GKP states is higher than 11.2dB in the case where the GKP states are the only noisy elements. We also show that the squeezing threshold changes to 18.6dB when both the GKP states and circuit elements are comparably noisy. At this threshold, each circuit component fails with probability 0.69%. Finally, if the GKP states are noiseless, fault-tolerant quantum error correction with the surface-GKP code is possible if each circuit element fails with probability less than 0.81%.

Superadditivity of Gaussian thermal loss channel capacities with respect to Gaussian input states (2020)

An article about this work is available here.

Accepted for a contributed talk at QIP 2021. 

Abstract

Quantum capacity of a noisy quantum channel is a fundamental quantity that quantifies the maximum number of quantum bits (per channel use) that can be transmitted faithfully through the noisy channel upon an optimal quantum error correction scheme. Gaussian thermal loss channels model energy loss and gain errors in realistic optical communication channels and microwave cavity modes. Thus, evaluation of the quantum capacity of a Gaussian thermal loss channel is of fundamental importance to the continuous-variable quantum information processing. 

The best known lower bound of the Gaussian thermal loss channel capacity was its coherent information with respect to an input single-mode thermal state, or an uncorrelated multi-mode thermal state. We found that sometimes correlated multi-mode thermal states can outperform the single-mode thermal state subject to the same average photon number constraint and thus established an improved lower bound of the Gaussian thermal loss channel capacity.  By doing so, we established the superadditivity of Gaussian thermal loss channels with respect to Gaussian input states. 

Optimality of GKP codes [qubit-into-an-oscillator] (2019)

Slides for the talk given at Rocky Mountain Summit on Quantum Information (2018 June) can be found here. 

Description

As shown in several earlier works, finding the optimal pair of encoding and decoding operations that maximizes entanglement fidelity is a biconvex optimization problem. To find the best pair of encoding and decoding operations for the Gaussian thermal loss channels, we solved the biconvex optimization heuristically by an alternating semidefinite programming method and found that, surprisingly, the hexagonal-lattice Gottesman-Kitaev-Preskill (GKP) code emerges as an optimal encoding from a Haar-random initial code. 

Achievable rate of GKP codes (2019)

Slides for the talk given at Rocky Mountain Summit on Quantum Information (2018 June) can be found here. 

Description

In addition to (heuristically) showing that the hexagonal-lattice GKP code is the optimal single-mode bosonic code for Gaussian thermal loss channels, we also proved that a family of multi-mode GKP codes (defined over an optimal symplectic lattice) achieves the quantum capacity of Gaussian thermal loss channels up to at most a constant number (~log_{2}e = 1.44...) of qubits per channel use.