arXiv subjects

He-Liang Huang

Publications and source records attributed to He-Liang Huang.

At least 55 records · Page 3Linked to original sources

arXiv2021

Quantum-Inspired Support Vector Machine

Support vector machine (SVM) is a particularly powerful and flexible supervised learning model that analyzes data for both classification and regression, whose usual algorithm complexity scales polynomially with the dimension of data space and the number of data points. To tackle the big data challenge, a quantum SVM algorithm was proposed, which is claimed to achieve exponential speedup for least squares SVM (LS-SVM). Here, inspired by the quantum SVM algorithm, we present a quantum-inspired classical algorithm for LS-SVM. In our approach, a improved fast sampling technique, namely indirect sampling, is proposed for sampling the kernel matrix and classifying. We first consider the LS-SVM with a linear kernel, and then discuss the generalization of our method to non-linear kernels. Theoretical analysis shows our algorithm can make classification with arbitrary success probability in logarithmic runtime of both the dimension of data space and the number of data points for low rank, low condition number and high dimensional data matrix, matching the runtime of the quantum SVM.

cs.LG↗

arXiv2021

Observation of strong and weak thermalization in a superconducting quantum processor

We experimentally study the ergodic dynamics of a 1D array of 12 superconducting qubits with a transverse field, and identify the regimes of strong and weak thermalization with different initial states. We observe convergence of the local observable to its thermal expectation value in the strong-thermalizaion regime. For weak thermalization, the dynamics of local observable exhibits an oscillation around the thermal value, which can only be attained by the time average. We also demonstrate that the entanglement entropy and concurrence can characterize the regimes of strong and weak thermalization. Our work provides an essential step towards a generic understanding of thermalization in quantum systems.

quant-ph↗

arXiv2021

Observation of thermalization and information scrambling in a superconducting quantum processor

Understanding various phenomena in non-equilibrium dynamics of closed quantum many-body systems, such as quantum thermalization, information scrambling, and nonergodic dynamics, is a crucial for modern physics. Using a ladder-type superconducting quantum processor, we perform analog quantum simulations of both the $XX$ ladder and one-dimensional (1D) $XX$ model. By measuring the dynamics of local observables, entanglement entropy and tripartite mutual information, we signal quantum thermalization and information scrambling in the $XX$ ladder. In contrast, we show that the $XX$ chain, as free fermions on a 1D lattice, fails to thermalize, and local information does not scramble in the integrable channel. Our experiments reveal ergodicity and scrambling in the controllable qubit ladder, and opens the door to further investigations on the thermodynamics and chaos in quantum many-body systems.

quant-ph↗

arXiv2020

Emulating quantum teleportation of a Majorana zero mode qubit

Topological quantum computation based on anyons is a promising approach to achieve fault-tolerant quantum computing. The Majorana zero modes in the Kitaev chain are an example of non-Abelian anyons where braiding operations can be used to perform quantum gates. Here we perform a quantum simulation of topological quantum computing, by teleporting a qubit encoded in the Majorana zero modes of a Kitaev chain. The quantum simulation is performed by mapping the Kitaev chain to its equivalent spin version, and realizing the ground states in a superconducting quantum processor. The teleportation transfers the quantum state encoded in the spin-mapped version of the Majorana zero mode states between two Kitaev chains. The teleportation circuit is realized using only braiding operations, and can be achieved despite being restricted to Clifford gates for the Ising anyons. The Majorana encoding is a quantum error detecting code for phase flip errors, which is used to improve the average fidelity of the teleportation for six distinct states from $70.76 \pm 0.35 \% $ to $84.60 \pm 0.11 \%$, well beyond the classical bound in either case.

quant-ph↗

arXiv2020

Verifying Random Quantum Circuits with Arbitrary Geometry Using Tensor Network States Algorithm

The ability to efficiently simulate random quantum circuits using a classical computer is increasingly important for developing Noisy Intermediate-Scale Quantum devices. Here we present a tensor network states based algorithm specifically designed to compute amplitudes for random quantum circuits with arbitrary geometry. Singular value decomposition based compression together with a two-sided circuit evolution algorithm are used to further compress the resulting tensor network. To further accelerate the simulation, we also propose a heuristic algorithm to compute the optimal tensor contraction path. We demonstrate that our algorithm is up to $2$ orders of magnitudes faster than the Sch$\ddot{\text{o}}$dinger-Feynman algorithm for verifying random quantum circuits on the $53$-qubit Sycamore processor, with circuit depths below $12$. We also simulate larger random quantum circuits up to $104$ qubits, showing that this algorithm is an ideal tool to verify relatively shallow quantum circuits on near-term quantum computers.

quant-ph↗

arXiv2020

Superconducting Quantum Computing: A Review

Over the last two decades, tremendous advances have been made for constructing large-scale quantum computers. In particular, the quantum processor architecture based on superconducting qubits has become the leading candidate for scalable quantum computing platform, and the milestone of demonstrating quantum supremacy was first achieved using 53 superconducting qubits in 2019. In this work, we provide a brief review on the experimental efforts towards building a large-scale superconducting quantum computer, including qubit design, quantum control, readout techniques, and the implementations of error correction and quantum algorithms. Besides the state of the art, we finally discuss future perspectives, and which we hope will motivate further research.

quant-ph↗

arXiv2020

Variational Quantum Circuits for Quantum State Tomography

Quantum state tomography is a key process in most quantum experiments. In this work, we employ quantum machine learning for state tomography. Given an unknown quantum state, it can be learned by maximizing the fidelity between the output of a variational quantum circuit and this state. The number of parameters of the variational quantum circuit grows linearly with the number of qubits and the circuit depth, so that only polynomial measurements are required, even for highly-entangled states. After that, a subsequent classical circuit simulator is used to transform the information of the target quantum state from the variational quantum circuit into a familiar format. We demonstrate our method by performing numerical simulations for the tomography of the ground state of a one-dimensional quantum spin chain, using a variational quantum circuit simulator. Our method is suitable for near-term quantum computing platforms, and could be used for relatively large-scale quantum state tomography for experimentally relevant quantum states.

quant-ph↗

arXiv2019

Demonstration of Topological Data Analysis on a Quantum Processor

Topological data analysis offers a robust way to extract useful information from noisy, unstructured data by identifying its underlying structure. Recently, an efficient quantum algorithm was proposed [Lloyd, Garnerone, Zanardi, Nat. Commun. 7, 10138 (2016)] for calculating Betti numbers of data points -- topological features that count the number of topological holes of various dimensions in a scatterplot. Here, we implement a proof-of-principle demonstration of this quantum algorithm by employing a six-photon quantum processor to successfully analyze the topological features of Betti numbers of a network including three data points, providing new insights into data analysis in the era of quantum computing.

quant-ph↗

arXiv2019

General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier

Recent advances on quantum computing hardware have pushed quantum computing to the verge of quantum supremacy. Random quantum circuits are outstanding candidates to demonstrate quantum supremacy, which could be implemented on a quantum device that supports nearest-neighbour gate operations on a two-dimensional configuration. Here we show that using the Projected Entangled-Pair States algorithm, a tool to study two-dimensional strongly interacting many-body quantum systems, we can realize an effective general-purpose simulator of quantum algorithms. This technique allows to quantify precisely the memory usage and the time requirements of random quantum circuits, thus showing the frontier of quantum supremacy. With this approach we can compute the full wave-function of the system, from which single amplitudes can be sampled with unit fidelity. Applying this general quantum circuit simulator we measured amplitudes for a $7\times 7$ lattice of qubits with depth $1+40+1$ and double-precision numbers in 31 minutes using less than $93$ TB memory on the Tianhe-2 supercomputer.

quant-ph↗

arXiv2019

Simulating the Dynamics of Single Photons in BosonSampling Devices with Matrix Product States

BosonSampling is a well-defined scheme for demonstrating quantum supremacy with photons in near term. Although relying only on multi-photon interference in nonadaptive linear-optical networks, it is hard to simulate classically. Here we study BosonSampling using matrix product states, a powerful method from quantum many-body physics. This method stores the instantaneous quantum state during the evolution of photons in the optical quantum circuit, which allows us to reveal the dynamical features of single photons in BosonSampling devices, such as entanglement entropy growth. We show the flexiblility of this method by also applying it to dissipative optical quantum circuits, as well as circuits with fermionic particles. Our work shows that matrix product states is a powerful platform to simulate optical quantum circuits. And it is readily extended to study quantum dynamics in multi-particle quantum walks beyond BosonSampling.

quant-ph↗

arXiv2018

Complementary-multiphase quantum search for all numbers of target items

Grover's algorithm achieves a quadratic speedup over classical algorithms, but it is considered necessary to know the value of $λ$ exactly [Phys. Rev. Lett. 95, 150501 (2005); Phys. Rev. Lett. 113, 210501 (2014)], where $λ$ is the fraction of target items in the database. In this paper, we find out that the Grover algorithm can actually apply to the case where one can identify the range that $λ$ belongs to from a given series of disjoint ranges. However, Grover's algorithm still cannot maintain high success probability when there exist multiple target items. For this problem, we proposed a complementary-multiphase quantum search algorithm, %with general iterations, in which multiple phases complement each other so that the overall high success probability can be maintained. Compared to the existing algorithms, in the case defined above, for the first time our algorithm achieves the following three goals simultaneously: (1) the success probability can be no less than any given value between 0 and 1, (2) the algorithm is applicable to the entire range of $λ$, and (3) the number of iterations is almost the same as that of Grover's algorithm. Especially compared to the optimal fixed-point algorithm [Phys. Rev. Lett. 113, 210501 (2014)], our algorithm uses fewer iterations to achieve success probability greater than 82.71\%, e.g., when the minimum success probability is required to be 99.25\%, the number of iterations can be reduced by 50\%.

quant-ph↗

arXiv2018

Experimental Test of Generalized Hardy's Paradox

Since the pillars of quantum theory were established, it was already noted that quantum physics may allow certain correlations defying any local realistic picture of nature, as first recognized by Einstein, Podolsky and Rosen. These quantum correlations, now termed quantum nonlocality and tested by violation of Bell's inequality that consists of statistical correlations fulfilling local realism, have found loophole-free experimental confirmation. A more striking way to demonstrate the conflict exists, and can be extended to the multipartite scenario. Here we report experimental confirmation of such a striking way, the multipartite generalized Hardy's paradoxes, in which no inequality is used and the conflict is stronger than that within just two parties. The paradoxes we are considering here belong to a general framework [S.-H. Jiang \emph{et al.}, Phys. Rev. Lett. 120, 050403 (2018)], including previously known multipartite extensions of Hardy's original paradox as special cases. The conflict shown here is stronger than in previous multipartite Hardy's paradox. Thus, the demonstration of Hardy-typed quantum nonlocality becomes sharper than ever.

quant-ph↗

arXiv2018

Demonstration of the Essentiality of Entanglement in a Deutsch-like Quantum Algorithm

Quantum algorithms could efficiently solve certain classically intractable problems by exploiting quantum parallelism. To date, whether the quantum entanglement is useful or not for quantum computing is still a question of debate. Here, we present a new quantum algorithm to show that entanglement could help to gain advantage over classical algorithm and even the quantum algorithm without entanglement. Furthermore, we implement experiments to demonstrate our proposed algorithm using superconducting qubits. Our results show the viability of the algorithm and suggest that entanglement is essential in getting quantum speedup for certain problems in quantum computing, which provide a reliable and clear guidance for developing useful quantum algorithms in future.

quant-ph↗

arXiv2018

18-qubit entanglement with photon's three degrees of freedom

A central theme in quantum information science is to coherently control an increasing number of quantum particles as well as their internal and external degrees of freedom (DoFs), meanwhile maintaining a high level of coherence. The ability to create and verify multiparticle entanglement with individual control and measurement of each qubit serves as an important benchmark for quantum technologies. To this end, genuine multipartite entanglement have been reported up to 14 trapped ions, 10 photons, and 10 superconducting qubits. Here, we experimentally demonstrate an 18-qubit Greenberger-Horne-Zeilinger (GHZ) entanglement by simultaneous exploiting three different DoFs of six photons, including their paths, polarization, and orbital angular momentum (OAM). We develop high-stability interferometers for reversible quantum logic operations between the photon's different DoFs with precision and efficiencies close to unity, enabling simultaneous readout of 262,144 outcome combinations of the 18-qubit state. A state fidelity of 0.708(16) is measured, confirming the genuine entanglement of all the 18 qubits.

quant-ph↗

arXiv2017

Ground state cooling in a hybrid optomechanical system with a three-level atomic ensemble

Cooling mechanical resonators is of great importance for both fundamental study and applied science. We investigate the hybrid optomechanical cooling with a three-level atomic ensemble fixed in a strong excited optical cavity. By using the quantum noise approach, we find the upper bound of the noise spectrum and further present three optimal parameter conditions, which can yield a small heating coefficient, a large cooling coefficient, and thus a small final phonon number. Moreover, through the covariance matrix approach, results of numerical simulation are obtained, which are consistent with the theoretical expectations. It is demonstrated that our scheme can achieve ground state cooling in the highly unresolved sideband regime, within the current experimental technologies. Compared with the previous cooling methods, in our scheme, there are fewer constraints on the drive strength of atomic ensemble and number of atoms in the ensemble. In addition, the tolerable ranges of parameters for ground state cooling are extended. As a result, our scheme is very suitable for experiments and can be a guideline for the research of hybrid optomechanical cooling.

quant-ph↗

arXiv2017

Multiphoton interference in quantum Fourier transform circuits and applications to quantum metrology

Quantum Fourier transforms (QFT) have gained increased attention with the rise of quantum walks, boson sampling, and quantum metrology. Here we present and demonstrate a general technique that simplifies the construction of QFT interferometers using both path and polarization modes. On that basis, we first observed the generalized Hong-Ou-Mandel effect with up to four photons. Furthermore, we directly exploited number-path entanglement generated in these QFT interferometers and demonstrated optical phase supersensitivities deterministically.

quant-ph↗

arXiv2017

Experimental Blind Quantum Computing for a Classical Client

To date, blind quantum computing demonstrations require clients to have weak quantum devices. Here we implement a proof-of-principle experiment for completely classical clients. Via classically interacting with two quantum servers that share entanglement, the client accomplishes the task of having the number 15 factorized by servers who are denied information about the computation itself. This concealment is accompanied by a verification protocol that tests servers' honesty and correctness. Our demonstration shows the feasibility of completely classical clients and thus is a key milestone towards secure cloud quantum computing.

quant-ph↗

arXiv2017

Homomorphic Encryption Experiments on IBM's Cloud Quantum Computing Platform

Quantum computing has undergone rapid development in recent years. Owing to limitations on scalability, personal quantum computers still seem slightly unrealistic in the near future. The first practical quantum computer for ordinary users is likely to be on the cloud. However, the adoption of cloud computing is possible only if security is ensured. Homomorphic encryption is a cryptographic protocol that allows computation to be performed on encrypted data without decrypting them, so it is well suited to cloud computing. Here, we first applied homomorphic encryption on IBM's cloud quantum computer platform. In our experiments, we successfully implemented a quantum algorithm for linear equations while protecting our privacy. This demonstration opens a feasible path to the next stage of development of cloud quantum information technology.

cs.CR↗