Searcharxiv⌕ Search

arXiv subjects

Sheng-Tao Wang

Publications and source records attributed to Sheng-Tao Wang.

At least 37 records · Page 2Linked to original sources

Large-scale quantum reservoir learning with an analog quantum computer

Quantum machine learning has gained considerable attention as quantum technology advances, presenting a promising approach for efficiently learning complex data patterns. Despite this promise, most contemporary quantum methods require significant resources for variational parameter optimization and face issues with vanishing gradients, leading to experiments that are either limited in scale or lack potential for quantum advantage. To address this, we develop a general-purpose, gradient-free, and scalable quantum reservoir learning algorithm that harnesses the quantum dynamics of neutral-atom analog quantum computers to process data. We experimentally implement the algorithm, achieving competitive performance across various categories of machine learning tasks, including binary and multi-class classification, as well as timeseries prediction. Effective and improving learning is observed with increasing system sizes of up to 108 qubits, demonstrating the largest quantum machine learning experiment to date. We further observe comparative quantum kernel advantage in learning tasks by constructing synthetic datasets based on the geometric differences between generated quantum and classical data kernels. Our findings demonstrate the potential of utilizing classically intractable quantum correlations for effective machine learning. We expect these results to stimulate further extensions to different quantum hardware and machine learning paradigms, including early fault-tolerant hardware and generative machine learning tasks.

quant-ph↗

Solving non-native combinatorial optimization problems using hybrid quantum-classical algorithms

Combinatorial optimization is a challenging problem applicable in a wide range of fields from logistics to finance. Recently, quantum computing has been used to attempt to solve these problems using a range of algorithms, including parameterized quantum circuits, adiabatic protocols, and quantum annealing. These solutions typically have several challenges: 1) there is little to no performance gain over classical methods, 2) not all constraints and objectives may be efficiently encoded in the quantum ansatz, and 3) the solution domain of the objective function may not be the same as the bit strings of measurement outcomes. This work presents "non-native hybrid algorithms" (NNHA): a framework to overcome these challenges by integrating quantum and classical resources with a hybrid approach. By designing non-native quantum variational ansatzes that inherit some but not all problem structure, measurement outcomes from the quantum computer can act as a resource to be used by classical routines to indirectly compute optimal solutions, partially overcoming the challenges of contemporary quantum optimization approaches. These methods are demonstrated using a publicly available neutral-atom quantum computer on two simple problems of Max $k$-Cut and maximum independent set. We find improvements in solution quality when comparing the hybrid algorithm to its ``no quantum" version, a demonstration of a "comparative advantage".

quant-ph↗

Probing quantum floating phases in Rydberg atom arrays

The floating phase, a critical incommensurate phase, has been theoretically predicted as a potential intermediate phase between crystalline ordered and disordered phases. In this study, we investigate the different quantum phases that arise in ladder arrays comprising up to 92 neutral-atom qubits and experimentally observe the emergence of the quantum floating phase. We analyze the site-resolved Rydberg state densities and the distribution of state occurrences. The site-resolved measurement reveals the formation of domain walls within the commensurate ordered phase, which subsequently proliferate and give rise to the floating phase with incommensurate quasi-long-range order. By analyzing the Fourier spectra of the Rydberg density-density correlations, we observe clear signatures of the incommensurate wave order of the floating phase. Furthermore, as the experimental system sizes increase, we show that the wave vectors approach a continuum of values incommensurate with the lattice. Our work motivates future studies to further explore the nature of commensurate-incommensurate phase transitions and their non-equilibrium physics.

quant-ph↗

Quantum dynamics of a fully-blockaded Rydberg atom ensemble

Classical simulation of quantum systems plays an important role in the study of many-body phenomena and in the benchmarking and verification of quantum technologies. Exact simulation is often limited to small systems because the dimension of the Hilbert space increases exponentially with the size of the system. For systems that possess a high degree of symmetry, however, classical simulation can reach much larger sizes. Here, we consider an ensemble of strongly interacting atoms with permutation symmetry, enabling the simulation of dynamics of hundreds of atoms at arbitrarily long evolution times. The system is realized by an ensemble of three-level atoms, where one of the levels corresponds to a highly excited Rydberg state. In the limit of all-to-all Rydberg blockade, the Hamiltonian is invariant under permutation of the atoms. Using techniques from representation theory, we construct a block-diagonal form of the Hamiltonian, where the size of the largest block increases only linearly with the system size. We apply this formalism to derive efficient pulse sequences to prepare arbitrary permutation-invariant quantum states. Moreover, we study the quantum dynamics following a quench, uncovering a parameter regime in which the system thermalizes slowly and exhibits pronounced revivals. Our results create new opportunities for the experimental and theoretical study of large interacting and nonintegrable quantum systems.

quant-ph↗

Aquila: QuEra's 256-qubit neutral-atom quantum computer

The neutral-atom quantum computer "Aquila" is QuEra's latest device available through the Braket cloud service on Amazon Web Services (AWS). Aquila is a "field-programmable qubit array" (FPQA) operated as an analog Hamiltonian simulator on a user-configurable architecture, executing programmable coherent quantum dynamics on up to 256 neutral-atom qubits. This whitepaper serves as an overview of Aquila and its capabilities: how it works under the hood, key performance benchmarks, and examples that demonstrate some quintessential applications. This includes an overview of neutral-atom quantum computing, as well as five examples of increasing complexity from single-qubit dynamics to combinatorial optimization, implemented on Aquila. This whitepaper is intended for readers who are interested in learning more about neutral-atom quantum computing, as a guide for those who are ready to start using Aquila, and as a reference point for its performance as an analog quantum computer.

quant-ph↗

Quantum optimization with arbitrary connectivity using Rydberg atom arrays

Programmable quantum systems based on Rydberg atom arrays have recently been used for hardware-efficient tests of quantum optimization algorithms [Ebadi et al., Science, 376, 1209 (2022)] with hundreds of qubits. In particular, the maximum independent set problem on so-called unit-disk graphs, was shown to be efficiently encodable in such a quantum system. Here, we extend the classes of problems that can be efficiently encoded in Rydberg arrays by constructing explicit mappings from a wide class of problems to maximum weighted independent set problems on unit-disk graphs, with at most a quadratic overhead in the number of qubits. We analyze several examples, including: maximum weighted independent set on graphs with arbitrary connectivity, quadratic unconstrained binary optimization problems with arbitrary or restricted connectivity, and integer factorization. Numerical simulations on small system sizes indicate that the adiabatic time scale for solving the mapped problems is strongly correlated with that of the original problems. Our work provides a blueprint for using Rydberg atom arrays to solve a wide range of combinatorial optimization problems with arbitrary connectivity, beyond the restrictions imposed by the hardware geometry.

quant-ph↗

Trimer quantum spin liquid in a honeycomb array of Rydberg atoms

Quantum spin liquids are elusive but paradigmatic examples of strongly correlated quantum states that are characterized by long-range quantum entanglement. Recently, the direct signatures of a gapped topological $\mathbb{Z}_2$ spin liquid have been observed in a system of Rydberg atoms arrayed on the ruby lattice. Here, we illustrate the concrete realization of a fundamentally different class of spin liquids in a honeycomb array of Rydberg atoms. Exploring the quantum phase diagram of this system using both density-matrix renormalization group and exact diagonalization simulations, several density-wave-ordered phases are characterized and their origins explained. More interestingly, in the regime where third-nearest-neighbor atoms lie within the Rydberg blockade radius, we find a novel ground state -- with an emergent $\mathrm{U}(1)\times \mathrm{U}(1)$ local symmetry -- formed from superpositions of classical {\it trimer} configurations on the dual triangular lattice. The fidelity of this trimer spin liquid state can be enhanced via dynamical preparation, which we explain by a Rydberg-blockade-based projection mechanism associated with the smooth turnoff of the laser drive. Finally, we discuss the robustness of the trimer spin liquid phase under realistic experimental parameters and demonstrate that our proposal can be readily implemented in current Rydberg atom quantum simulators.

cond-mat.quant-gas↗

Computing solution space properties of combinatorial optimization problems via generic tensor networks

We introduce a unified framework to compute the solution space properties of a broad class of combinatorial optimization problems. These properties include finding one of the optimum solutions, counting the number of solutions of a given size, and enumeration and sampling of solutions of a given size. Using the independent set problem as an example, we show how all these solution space properties can be computed in the unified approach of generic tensor networks. We demonstrate the versatility of this computational tool by applying it to several examples, including computing the entropy constant for hardcore lattice gases, studying the overlap gap properties, and analyzing the performance of quantum and classical algorithms for finding maximum independent sets.

cond-mat.stat-mech↗

Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms

Neutral atom arrays have recently emerged as a promising platform for quantum information processing. One important remaining roadblock for the large-scale application of these systems is the ability to perform error-corrected quantum operations. To entangle the qubits in these systems, atoms are typically excited to Rydberg states, which could decay or give rise to various correlated errors that cannot be addressed directly through traditional methods of fault-tolerant quantum computation. In this work, we provide the first complete characterization of these sources of error in a neutral-atom quantum computer and propose hardware-efficient, fault-tolerant quantum computation schemes that mitigate them. Notably, we develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. These advances allow us to significantly reduce the resource cost for fault-tolerant quantum computation compared to existing, general-purpose schemes. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.

quant-ph↗

Enhancing Generative Models via Quantum Correlations

Generative modeling using samples drawn from the probability distribution constitutes a powerful approach for unsupervised machine learning. Quantum mechanical systems can produce probability distributions that exhibit quantum correlations which are difficult to capture using classical models. We show theoretically that such quantum correlations provide a powerful resource for generative modeling. In particular, we provide an unconditional proof of separation in expressive power between a class of widely-used generative models, known as Bayesian networks, and its minimal quantum extension. We show that this expressivity advantage is associated with quantum nonlocality and quantum contextuality. Furthermore, we numerically test this separation on standard machine learning data sets and show that it holds for practical problems. The possibility of quantum advantage demonstrated in this work not only sheds light on the design of useful quantum machine learning protocols but also provides inspiration to draw on ideas from quantum foundations to improve purely classical algorithms.

quant-ph↗

Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices

The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical variational algorithm designed to tackle combinatorial optimization problems. Despite its promise for near-term quantum applications, not much is currently understood about QAOA's performance beyond its lowest-depth variant. An essential but missing ingredient for understanding and deploying QAOA is a constructive approach to carry out the outer-loop classical optimization. We provide an in-depth study of the performance of QAOA on MaxCut problems by developing an efficient parameter-optimization procedure and revealing its ability to exploit non-adiabatic operations. Building on observed patterns in optimal parameters, we propose heuristic strategies for initializing optimizations to find quasi-optimal $p$-level QAOA parameters in $O(\text{poly}(p))$ time, whereas the standard strategy of random initialization requires $2^{O(p)}$ optimization runs to achieve similar performance. We then benchmark QAOA and compare it with quantum annealing, especially on difficult instances where adiabatic quantum annealing fails due to small spectral gaps. The comparison reveals that QAOA can learn via optimization to utilize non-adiabatic mechanisms to circumvent the challenges associated with vanishing spectral gaps. Finally, we provide a realistic resource analysis on the experimental implementation of QAOA. When quantum fluctuations in measurements are accounted for, we illustrate that optimization will be important only for problem sizes beyond numerical simulations, but accessible on near-term devices. We propose a feasible implementation of large MaxCut problems with a few hundred vertices in a system of 2D neutral atoms, reaching the regime to challenge the best classical algorithms.

quant-ph↗

Machine Learning Topological Phases with a Solid-state Quantum Simulator

We report an experimental demonstration of a machine learning approach to identify exotic topological phases, with a focus on the three-dimensional chiral topological insulators. We show that the convolutional neural networks---a class of deep feed-forward artificial neural networks with widespread applications in machine learning---can be trained to successfully identify different topological phases protected by chiral symmetry from experimental raw data generated with a solid-state quantum simulator. Our results explicitly showcase the exceptional power of machine learning in the experimental detection of topological phases, which paves a way to study rich topological phenomena with the machine learning toolbox.

cond-mat.dis-nn↗

Computational complexity of the Rydberg blockade in two dimensions

We discuss the computational complexity of finding the ground state of the two-dimensional array of quantum bits that interact via strong van der Waals interactions. Specifically, we focus on systems where the interaction strength between two spins depends only on their relative distance $x$ and decays as $1/x^6$ that have been realized with individually trapped homogeneously excited neutral atoms interacting via the so-called Rydberg blockade mechanism. We show that the solution to NP-complete problems can be encoded in ground state of such a many-body system by a proper geometrical arrangement of the atoms. We present a reduction from the NP-complete maximum independent set problem on planar graphs with maximum degree three. Our results demonstrate that computationally hard optimization problems can be naturally addressed with coherent quantum optimizers accessible in near term experiments.

quant-ph↗

Quantum Optimization for Maximum Independent Set Using Rydberg Atom Arrays

We describe and analyze an architecture for quantum optimization to solve maximum independent set (MIS) problems using neutral atom arrays trapped in optical tweezers. Optimizing independent sets is one of the paradigmatic, NP-hard problems in computer science. Our approach is based on coherent manipulation of atom arrays via the excitation into Rydberg atomic states. Specifically, we show that solutions of MIS problems can be efficiently encoded in the ground state of interacting atoms in 2D arrays by utilizing the Rydberg blockade mechanism. By studying the performance of leading classical algorithms, we identify parameter regimes, where computationally hard instances can be tested using near-term experimental systems. Practical implementations of both quantum annealing and variational quantum optimization algorithms beyond the adiabatic principle are discussed.

quant-ph↗

Noise Analysis for High-Fidelity Quantum Entangling Gates in an Anharmonic Linear Paul Trap

The realization of high fidelity quantum gates in a multi-qubit system, with a typical target set at 99.9%, is a critical requirement for the implementation of fault-tolerant quantum computation. To reach this level of fidelity, one needs to carefully analyze the noises and imperfections in the experimental system and optimize the gate operations to mitigate their effects. Here, we consider one of the leading experimental systems for the fault-tolerant quantum computation, ions in an anharmonic linear Paul trap, and optimize entangling quantum gates using segmented laser pulses with the assistance of all the collective transverse phonon modes of the ion crystal. We present detailed analyses of the effects of various kinds of intrinsic experimental noises as well as errors from imperfect experimental controls. Through explicit calculations, we find the requirements on these relevant noise levels and control precisions to achieve the targeted high fidelity of 99.9% for the entangling quantum gates in a multi-ion crystal.

quant-ph↗

Classification of Quench Dynamical Behaviours in Spinor Condensates

Thermalization of isolated quantum systems is a long-standing fundamental problem where different mechanisms are proposed over time. We contribute to this discussion by classifying the diverse quench dynamical behaviours of spin-1 Bose-Einstein condensates, which includes well-defined quantum collapse and revivals, thermalization, and certain special cases. These special cases are either nonthermal equilibration with no revival but a collapse even though the system has finite degrees of freedom or no equilibration with no collapse and revival. Given that some integrable systems are already shown to demonstrate the weak form of eigenstate thermalization hypothesis (ETH), we determine the regions where ETH holds and fails in this integrable isolated quantum system. The reason behind both thermalizing and nonthermalizing behaviours in the same model under different initial conditions is linked to the discussion of `rare' nonthermal states existing in the spectrum. We also propose a method to predict the collapse and revival time scales and how they scale with the number of particles in the condensate. We use a sudden quench to drive the system to non-equilibrium and hence the theoretical predictions given in this paper can be probed in experiments.

quant-ph↗

Simulating the performance of a distance-3 surface code in a linear ion trap

We explore the feasibility of implementing a small surface code with 9 data qubits and 8 ancilla qubits, commonly referred to as surface-17, using a linear chain of 171Yb+ ions. Two-qubit gates can be performed between any two ions in the chain with gate time increasing linearly with ion distance. Measurement of the ion state by fluorescence requires that the ancilla qubits be physically separated from the data qubits to avoid errors on the data due to scattered photons. We minimize the time required to measure one round of stabilizers by optimizing the mapping of the two-dimensional surface code to the linear chain of ions. We develop a physically motivated Pauli error model that allows for fast simulation and captures the key sources of noise in an ion trap quantum computer including gate imperfections and ion heating. Our simulations showed a consistent requirement of a two-qubit gate fidelity of > 99.9% for logical memory to have a better fidelity than physical two-qubit operations. Finally, we perform an analysis on the error subsets from the importance sampling method used to approximate the logical error rates in this paper to gain insight into which error sources are particularly detrimental to error correction.

quant-ph↗

Quantum Supremacy for Simulating A Translation-Invariant Ising Spin Model

We introduce an intermediate quantum computing model built from translation-invariant Ising-interacting spins. Despite being non-universal, the model cannot be classically efficiently simulated unless the polynomial hierarchy collapses. Equipped with the intrinsic single-instance-hardness property, a single fixed unitary evolution in our model is sufficient to produce classically intractable results, compared to several other models that rely on implementation of an ensemble of different unitaries (instances). We propose a feasible experimental scheme to implement our Hamiltonian model using cold atoms trapped in a square optical lattice. We formulate a procedure to certify the correct functioning of this quantum machine. The certification requires only a polynomial number of local measurements assuming measurement imperfections are sufficiently small.

quant-ph↗