Yunseong Nam

Yunseong Nam

Auto-generated profile, based on publicly available information

Yunseong Nam

IonQ

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
29 November 2019 in Nature Communications
Verified
Journal Article
Open access
PDF file
KWK. Wright
K. Wright
KBK. M. Beck
K. M. Beck
SDS. Debnath
S. Debnath
JAJ. M. Amini
J. M. Amini
YNY. Nam
Y. Nam
JKJ. Kim
J. Kim
The field of quantum computing has grown from concept to demonstration devices over the past 20 years. Universal quantum computing offers efficiency in approaching problems of scientific and commercial interest, such as factoring large numbers, searching databases, simulating intractable models from quantum physics, and optimizing complex cost functions. Here, we present an 11-qubit fully-connected, programmable quantum computer in a trapped ion system composed of 13 171Yb+ ions. We demonstrate average single-qubit gate fidelities of 99.5 $$\%$$% , average two-qubit-gate fidelities of 97.5 $$\%$$% , and SPAM errors of 0.7 $$\%$$% . To illustrate the capabilities of this universal platform and provide a basis for comparison with similarly-sized devices, we compile the Bernstein-Vazirani and Hidden Shift algorithms into our native gates and execute them on the hardware with average success rates of 78 $$\%$$% and 35 $$\%$$% , respectively. These algorithms serve as excellent benchmarks for any type of quantum hardware, and show that our system outperforms all other currently available hardware.

3 April 2020 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
YNYunseong Nam
Yunseong Nam
JCJwo-Sy Chen
Jwo-Sy Chen
NPNeal C. Pisenti
Neal C. Pisenti
KWKenneth Wright
Kenneth Wright
CDConor Delaney
Conor Delaney
JKJungsang Kim
Jungsang Kim
Quantum computing leverages the quantum resources of superposition and entanglement to efficiently solve computational problems considered intractable for classical computers. Examples include calculating molecular and nuclear structure, simulating strongly interacting electron systems, and modeling aspects of material function. While substantial theoretical advances have been made in mapping these problems to quantum algorithms, there remains a large gap between the resource requirements for solving such problems and the capabilities of currently available quantum hardware. Bridging this gap will require a co-design approach, where the expression of algorithms is developed in conjunction with the hardware itself to optimize execution. Here we describe an extensible co-design framework for solving chemistry problems on a trapped-ion quantum computer and apply it to estimating the ground-state energy of the water molecule using the variational quantum eigensolver (VQE) method. The controllability of the trapped-ion quantum computer enables robust energy estimates using the prepared VQE ansatz states. The systematic and statistical errors are comparable to the chemical accuracy, which is the target threshold necessary for predicting the rates of chemical reaction dynamics, without resorting to any error mitigation techniques based on Richardson extrapolation.

10 May 2018 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
YNYunseong Nam
Yunseong Nam
NRNeil J. Ross
Neil J. Ross
YSYuan Su
Yuan Su
ACAndrew M. Childs
Andrew M. Childs
DMDmitri Maslov
Dmitri Maslov
We develop and implement automated methods for optimizing quantum circuits of the size and type expected in quantum computations that outperform classical computers. We show how to handle continuous gate parameters and report a collection of fast algorithms capable of optimizing large-scale quantum circuits. For the suite of benchmarks considered, we obtain substantial reductions in gate counts. In particular, we provide better optimization in significantly less time than previous approaches, while making minimal structural changes so as to preserve the basic layout of the underlying quantum algorithms. Our results help bridge the gap between the computations that can be run on existing hardware and those that are expected to outperform classical computers.

13 March 2020 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
YNYunseong Nam
Yunseong Nam
YSYuan Su
Yuan Su
DMDmitri Maslov
Dmitri Maslov
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete logarithm over Abelian groups, solving systems of linear equations, and phase estimation, to name a few. The standard fault-tolerant implementation of an n-qubit unitary QFT approximates the desired transformation by removing small-angle controlled rotations and synthesizing the remaining ones into Clifford+T gates, incurring the T-count complexity of $$O(n\,{\mathrm{log}}^{2}\,(n))$$ O ( n log 2 ( n ) ) . In this paper, we show how to obtain approximate QFT with the T-count of $$O(n\,{\mathrm{log}}\,(n))$$ O ( n log ( n ) ) . For brevity, the above figures omit the dependence on the approximation error ε, assuming the error is fixed. Our approach relies on quantum circuits with measurements and feedforward, and on reusing a special quantum state that induces the phase gradient transformation. We report asymptotic analysis as well as concrete circuits, demonstrating significant advantages in both theory and practice.

11 June 2020 in Nature Communications
Verified
Journal Article
Open access
NGNikodem Grzesiak
Nikodem Grzesiak
RReinhold Blümel
Reinhold Blümel
KWKenneth Wright
Kenneth Wright
KBKristin M. Beck
Kristin M. Beck
NPNeal C. Pisenti
Neal C. Pisenti
YNYunseong Nam
Yunseong Nam
Efficiently entangling pairs of qubits is essential to fully harness the power of quantum computing. Here, we devise an exact protocol that simultaneously entangles arbitrary pairs of qubits on a trapped-ion quantum computer. The protocol requires classical computational resources polynomial in the system size, and very little overhead in the quantum control compared to a single-pair case. We demonstrate an exponential improvement in both classical and quantum resources over the current state of the art. We implement the protocol on a software-defined trapped-ion quantum computer, where we reconfigure the quantum computer architecture on demand. Our protocol may also be extended to a wide variety of other quantum computing platforms.

18 November 2021 in Communications Physics
Verified
Journal Article
Open access
PDF file
YKYukio Kawashima
Yukio Kawashima
ELErika Lloyd
Erika Lloyd
MCMarc P. Coons
Marc P. Coons
YNYunseong Nam
Yunseong Nam
SMShunji Matsuura
Shunji Matsuura
TYTakeshi Yamazaki
Takeshi Yamazaki
Quantum computers have the potential to advance material design and drug discovery by performing costly electronic structure calculations. A critical aspect of this application requires optimizing the limited resources of the quantum hardware. Here, we experimentally demonstrate an end-to-end pipeline that focuses on minimizing quantum resources while maintaining accuracy. Using density matrix embedding theory as a problem decomposition technique, and an ion-trap quantum computer, we simulate a ring of 10 hydrogen atoms without freezing any electrons. The originally 20-qubit system is decomposed into 10 two-qubit problems, making it amenable to currently available hardware. Combining this decomposition with a qubit coupled cluster circuit ansatz, circuit optimization, and density matrix purification, we accurately reproduce the potential energy curve in agreement with the full configuration interaction energy in the minimal basis set. Our experimental results are an early demonstration of the potential for problem decomposition to accurately simulate large molecules on quantum hardware.