arXiv subjects

Zhaokai Li

Publications and source records attributed to Zhaokai Li.

23 records · Page 2Linked to original sources

arXiv2016

Direct measurement of topological numbers with spins in diamond

Topological numbers can characterize the transition between different topological phases, which are not described by Landau's paradigm of symmetry breaking. Since the discovery of quantum Hall effect, more topological phases have been theoretically predicted and experimentally verified. However, it is still an experimental challenge to directly measure the topological number of various predicted topological phases. In this paper, we demonstrate quantum simulation of topological phase transition of a quantum wire (QW) using a single nitrogen-vacancy (NV) center in diamond. Deploying quantum algorithm of finding eigenvalues, we can reliably extract both the dispersion relations and topological numbers.

quant-ph↗

arXiv2016

Experimental observation of topological transitions in interacting multi-spin systems

Topologically ordered phase has emerged as one of most exciting concepts that not only broadens our understanding of phases of matter, but also has been found to have potential application in fault-tolerant quantum computation. The direct measurement of topological properties, however, is still a challenge especially in interacting quantum system. Here we realize one-dimensional Heisenberg spin chains using nuclear magnetic resonance simulators and observe the interaction-induced topological transitions, where Berry curvature in the parameter space of Hamiltonian is probed by means of dynamical response and then the first Chern number is extracted by integrating the curvature over the closed surface. The utilized experimental method provides a powerful means to explore topological phenomena in quantum systems with many-body interactions.

quant-ph↗

arXiv2014

Hybrid magic state distillation for universal fault-tolerant quantum computation

A set of stabilizer operations augmented by some special initial states known as 'magic states', gives the possibility of universal fault-tolerant quantum computation. However, magic state preparation inevitably involves nonideal operations that introduce noise. The most common method to eliminate the noise is magic state distillation (MSD) by stabilizer operations. Here we propose a hybrid MSD protocol by connecting a four-qubit H-type MSD with a five-qubit T-type MSD, in order to overcome some disadvantages of the previous MSD protocols. The hybrid MSD protocol further integrates distillable ranges of different existing MSD protocols and extends the T-type distillable range to the stabilizer octahedron edges. And it provides considerable improvement in qubit cost for almost all of the distillable range. Moreover, we experimentally demonstrate the four-qubit H-type MSD protocol using nuclear magnetic resonance technology, together with the previous five-qubit MSD experiment, to show the feasibility of the hybrid MSD protocol.

quant-ph↗

arXiv2013

Experimental realization of quantum algorithm for solving linear systems of equations

Quantum computers have the potential of solving certain problems exponentially faster than classical computers. Recently, Harrow, Hassidim and Lloyd proposed a quantum algorithm for solving linear systems of equations: given an $N\times{N}$ matrix $A$ and a vector $\vec b$, find the vector $\vec x$ that satisfies $A\vec x = \vec b$. It has been shown that using the algorithm one could obtain the solution encoded in a quantum state $|x$ using $O(\log{N})$ quantum operations, while classical algorithms require at least O(N) steps. If one is not interested in the solution $\vec{x}$ itself but certain statistical feature of the solution ${x}|M|x$ ($M$ is some quantum mechanical operator), the quantum algorithm will be able to achieve exponential speedup over the best classical algorithm as $N$ grows. Here we report a proof-of-concept experimental demonstration of the quantum algorithm using a 4-qubit nuclear magnetic resonance (NMR) quantum information processor. For all the three sets of experiments with different choices of $\vec b$, we obtain the solutions with over 96% fidelity. This experiment is a first implementation of the algorithm. Because solving linear systems is a common problem in nearly all fields of science and engineering, we will also discuss the implication of our results on the potential of using quantum computers for solving practical linear systems.

quant-ph↗

arXiv2011

Solving Quantum Ground-State Problems with Nuclear Magnetic Resonance

Quantum ground-state problems are computationally hard problems; for general many-body Hamiltonians, there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating the ground state is available, as often happens for many problems in physics and chemistry, a quantum computer could employ this trial wavefunction to project the ground state by means of the phase estimation algorithm (PEA). We performed an experimental realization of this idea by implementing a variational-wavefunction approach to solve the ground-state problem of the Heisenberg spin model with an NMR quantum simulator. Our iterative phase estimation procedure yields a high accuracy for the eigenenergies (to the 10^-5 decimal digit). The ground-state fidelity was distilled to be more than 80%, and the singlet-to-triplet switching near the critical field is reliably captured. This result shows that quantum simulators can better leverage classical trial wavefunctions than classical computers.

quant-ph↗