arXiv subjects

S. Boixo

Publications and source records attributed to S. Boixo.

At least 19 recordsLinked to original sources

arXiv2023

Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments

Today's experimental noisy quantum processors can compete with and surpass all known algorithms on state-of-the-art supercomputers for the computational benchmark task of Random Circuit Sampling [1-5]. Additionally, a circuit-based quantum simulation of quantum information scrambling [6], which measures a local observable, has already outperformed standard full wave function simulation algorithms, e.g., exact Schrodinger evolution and Matrix Product States (MPS). However, this experiment has not yet surpassed tensor network contraction for computing the value of the observable. Based on those studies, we provide a unified framework that utilizes the underlying effective circuit volume to explain the tradeoff between the experimentally achievable signal-to-noise ratio for a specific observable, and the corresponding computational cost. We apply this framework to recent quantum processor experiments of Random Circuit Sampling [5], quantum information scrambling [6], and a Floquet circuit unitary [7]. This allows us to reproduce the results of Ref. [7] in less than one second per data point using one GPU.

quant-ph↗

arXiv2022

Purification-based quantum error mitigation of pair-correlated electron simulations

An important measure of the development of quantum computing platforms has been the simulation of increasingly complex physical systems. Prior to fault-tolerant quantum computing, robust error mitigation strategies are necessary to continue this growth. Here, we study physical simulation within the seniority-zero electron pairing subspace, which affords both a computational stepping stone to a fully correlated model, and an opportunity to validate recently introduced ``purification-based'' error-mitigation strategies. We compare the performance of error mitigation based on doubling quantum resources in time (echo verification) or in space (virtual distillation), on up to $20$ qubits of a superconducting qubit quantum processor. We observe a reduction of error by one to two orders of magnitude below less sophisticated techniques (e.g. post-selection); the gain from error mitigation is seen to increase with the system size. Employing these error mitigation strategies enables the implementation of the largest variational algorithm for a correlated chemistry system to-date. Extrapolating performance from these results allows us to estimate minimum requirements for a beyond-classical simulation of electronic structure. We find that, despite the impressive gains from purification-based error mitigation, significant hardware improvements will be required for classically intractable variational chemistry simulations.

quant-ph↗

arXiv2021

Accurately computing electronic properties of a quantum ring

A promising approach to study condensed-matter systems is to simulate them on an engineered quantum platform. However, achieving the accuracy needed to outperform classical methods has been an outstanding challenge. Here, using eighteen superconducting qubits, we provide an experimental blueprint for an accurate condensed-matter simulator and demonstrate how to probe fundamental electronic properties. We benchmark the underlying method by reconstructing the single-particle band-structure of a one-dimensional wire. We demonstrate nearly complete mitigation of decoherence and readout errors and arrive at an accuracy in measuring energy eigenvalues of this wire with an error of ~0.01 rad, whereas typical energy scales are of order 1 rad. Insight into this unprecedented algorithm fidelity is gained by highlighting robust properties of a Fourier transform, including the ability to resolve eigenenergies with a statistical uncertainty of 1e-4 rad. Furthermore, we synthesize magnetic flux and disordered local potentials, two key tenets of a condensed-matter system. When sweeping the magnetic flux, we observe avoided level crossings in the spectrum, a detailed fingerprint of the spatial distribution of local disorder. Combining these methods, we reconstruct electronic properties of the eigenstates where we observe persistent currents and a strong suppression of conductance with added disorder. Our work describes an accurate method for quantum simulation and paves the way to study novel quantum materials with superconducting qubits.

quant-ph↗

arXiv2021

Realizing topologically ordered states on a quantum processor

The discovery of topological order has revolutionized the understanding of quantum matter in modern physics and provided the theoretical foundation for many quantum error correcting codes. Realizing topologically ordered states has proven to be extremely challenging in both condensed matter and synthetic quantum systems. Here, we prepare the ground state of the toric code Hamiltonian using an efficient quantum circuit on a superconducting quantum processor. We measure a topological entanglement entropy near the expected value of $\ln2$, and simulate anyon interferometry to extract the braiding statistics of the emergent excitations. Furthermore, we investigate key aspects of the surface code, including logical state injection and the decay of the non-local order parameter. Our results demonstrate the potential for quantum processors to provide key insights into topological quantum matter and quantum error correction.

quant-ph↗

arXiv2020

Direct measurement of non-local interactions in the many-body localized phase

The interplay of interactions and strong disorder can lead to an exotic quantum many-body localized (MBL) phase. Beyond the absence of transport, the MBL phase has distinctive signatures, such as slow dephasing and logarithmic entanglement growth; they commonly result in slow and subtle modification of the dynamics, making their measurement challenging. Here, we experimentally characterize these properties of the MBL phase in a system of coupled superconducting qubits. By implementing phase sensitive techniques, we map out the structure of local integrals of motion in the MBL phase. Tomographic reconstruction of single and two qubit density matrices allowed us to determine the spatial and temporal entanglement growth between the localized sites. In addition, we study the preservation of entanglement in the MBL phase. The interferometric protocols implemented here measure affirmative correlations and allow us to exclude artifacts due to the imperfect isolation of the system. By measuring elusive MBL quantities, our work highlights the advantages of phase sensitive measurements in studying novel phases of matter.

cond-mat.dis-nn↗

arXiv2020

Probing Environmental Spin Polarization with Superconducting Flux Qubits

We present measurements of the dynamics of a polarized magnetic environment coupled to the flux degree of freedom of rf-SQUID flux qubits. The qubits are used as both sources of polarizing field and detectors of the environmental polarization. We probe dynamics at timescales from 5 $μ$s to 5 ms and at temperatures between 12.5 and 22 mK. The measured polarization versus temperature provides strong evidence for a phase transition at a temperature of $5.7\pm 0.3$ mK. Furthermore, the environmental polarization grows initially as $\sqrt{t}$, consistent with spin diffusion dynamics. However, spin diffusion model deviates from data at long timescales, suggesting that a different phenomenon is responsible for the low-frequency behavior. A simple $1/f$ model can fit the data at all time scales but it requires empirical low- and high-frequency cutoffs. We argue that these results are consistent with an environment comprised of random clusters of spins, with fast spin diffusion dynamics within the clusters and slow fluctuations of the total moments of the clusters.

quant-ph↗

arXiv2020

Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms

Quantum algorithms offer a dramatic speedup for computational problems in machine learning, material science, and chemistry. However, any near-term realizations of these algorithms will need to be heavily optimized to fit within the finite resources offered by existing noisy quantum hardware. Here, taking advantage of the strong adjustable coupling of gmon qubits, we demonstrate a continuous two-qubit gate set that can provide a 3x reduction in circuit depth as compared to a standard decomposition. We implement two gate families: an iSWAP-like gate to attain an arbitrary swap angle, $θ$, and a CPHASE gate that generates an arbitrary conditional phase, $ϕ$. Using one of each of these gates, we can perform an arbitrary two-qubit gate within the excitation-preserving subspace allowing for a complete implementation of the so-called Fermionic Simulation, or fSim, gate set. We benchmark the fidelity of the iSWAP-like and CPHASE gate families as well as 525 other fSim gates spread evenly across the entire fSim($θ$, $ϕ$) parameter space achieving purity-limited average two-qubit Pauli error of $3.8 \times 10^{-3}$ per fSim gate.

quant-ph↗

arXiv2019

Diabatic gates for frequency-tunable superconducting qubits

We demonstrate diabatic two-qubit gates with Pauli error rates down to $4.3(2)\cdot 10^{-3}$ in as fast as 18 ns using frequency-tunable superconducting qubits. This is achieved by synchronizing the entangling parameters with minima in the leakage channel. The synchronization shows a landscape in gate parameter space that agrees with model predictions and facilitates robust tune-up. We test both iSWAP-like and CPHASE gates with cross-entropy benchmarking. The presented approach can be extended to multibody operations as well.

quant-ph↗

arXiv2018

Fluctuations of Energy-Relaxation Times in Superconducting Qubits

Superconducting qubits are an attractive platform for quantum computing since they have demonstrated high-fidelity quantum gates and extensibility to modest system sizes. Nonetheless, an outstanding challenge is stabilizing their energy-relaxation times, which can fluctuate unpredictably in frequency and time. Here, we use qubits as spectral and temporal probes of individual two-level-system defects to provide direct evidence that they are responsible for the largest fluctuations. This research lays the foundation for stabilizing qubit performance through calibration, design, and fabrication.

quant-ph↗

arXiv2017

A blueprint for demonstrating quantum supremacy with superconducting qubits

Fundamental questions in chemistry and physics may never be answered due to the exponential complexity of the underlying quantum phenomena. A desire to overcome this challenge has sparked a new industry of quantum technologies with the promise that engineered quantum systems can address these hard problems. A key step towards demonstrating such a system will be performing a computation beyond the capabilities of any classical computer, achieving so-called quantum supremacy. Here, using 9 superconducting qubits, we demonstrate an immediate path towards quantum supremacy. By individually tuning the qubit parameters, we are able to generate thousands of unique Hamiltonian evolutions and probe the output probabilities. The measured probabilities obey a universal distribution, consistent with uniformly sampling the full Hilbert-space. As the number of qubits in the algorithm is varied, the system continues to explore the exponentially growing number of states. Combining these large datasets with techniques from machine learning allows us to construct a model which accurately predicts the measured probabilities. We demonstrate an application of these algorithms by systematically increasing the disorder and observing a transition from delocalized states to localized states. By extending these results to a system of 50 qubits, we hope to address scientific questions that are beyond the capabilities of any classical computer.

quant-ph↗

arXiv2014

Computational complexity of time-dependent density functional theory

Time-dependent density functional theory (TDDFT) is rapidly emerging as a premier method for solving dynamical many-body problems in physics and chemistry. The mathematical foundations of TDDFT are established through the formal existence of a fictitious non-interacting system (known as the Kohn-Sham system), which can reproduce the one-electron reduced probability density of the actual system. We build upon these works and show that on the interior of the domain of existence, the Kohn-Sham system can be efficiently obtained given the time-dependent density. Since a quantum computer can efficiently produce such time-dependent densities, we present a polynomial time quantum algorithm to generate the time-dependent Kohn-Sham potential with controllable error bounds. As a consequence, in contrast to the known intractability result for ground state density functional theory (DFT), the computation of the necessary time-dependent potentials given the initial state is in the complexity class described by bounded error quantum computation in polynomial time (BQP).

quant-ph↗

arXiv2014

Entanglement in a quantum annealing processor

Entanglement lies at the core of quantum algorithms designed to solve problems that are intractable by classical approaches. One such algorithm, quantum annealing (QA), provides a promising path to a practical quantum processor. We have built a series of scalable QA processors consisting of networks of manufactured interacting spins (qubits). Here, we use qubit tunneling spectroscopy to measure the energy eigenspectrum of two- and eight-qubit systems within one such processor, demonstrating quantum coherence in these systems. We present experimental evidence that, during a critical portion of QA, the qubits become entangled and that entanglement persists even as these systems reach equilibrium with a thermal environment. Our results provide an encouraging sign that QA is a viable technology for large-scale quantum computing.

quant-ph↗

arXiv2011

Quantum locking of classical correlations and quantum discord of classical-quantum states

A locking protocol between two parties is as follows: Alice gives an encrypted classical message to Bob which she does not want Bob to be able to read until she gives him the key. If Alice is using classical resources, and she wants to approach unconditional security, then the key and the message must have comparable sizes. But if Alice prepares a quantum state, the size of the key can be comparatively negligible. This effect is called quantum locking. Entanglement does not play a role in this quantum advantage. We show that, in this scenario, the quantum discord quantifies the advantage of the quantum protocol over the corresponding classical one for any classical-quantum state.

quant-ph↗

arXiv2011

Operational interpretations of quantum discord

Quantum discord quantifies non-classical correlations going beyond the standard classification of quantum states into entangled and unentangled ones. Although it has received considerable attention, it still lacks any precise interpretation in terms of some protocol in which quantum features are relevant. Here we give quantum discord its first operational meaning in terms of entanglement consumption in an extended quantum state merging protocol. We further relate the asymmetry of quantum discord with the performance imbalance in quantum state merging and dense coding.

quant-ph↗

arXiv2010

Fast quantum algorithms for traversing paths of eigenstates

Consider a path of non-degenerate eigenstates of unitary operators or Hamiltonians with minimum eigenvalue gap G. The eigenpath traversal problem is to transform one or more copies of the initial to the final eigenstate. Solutions to this problem have applications ranging from quantum physics simulation to optimization. For Hamiltonians, the conventional way of doing this is by applying the adiabatic theorem. We give ``digital'' methods for performing the transformation that require no assumption on path continuity or differentiability other than the absence of large jumps. Given sufficient information about eigenvalues and overlaps between states on the path, the transformation can be accomplished with complexity O(L/G log(L/e)), where L is the angular length of the path and e is a specified bound on the error of the output state. We show that the required information can be obtained in a first set of transformations, whose complexity per state transformed has an additional factor that depends logarithmically on a maximum angular velocity along the path. This velocity is averaged over constant angular distances and does not require continuity. Our methods have substantially better behavior than conventional adiabatic algorithms, with fewer conditions on the path. They also improve on the previously best digital methods and demonstrate that path length and the gap are the primary parameters that determine the complexity of state transformation along a path.

quant-ph↗

arXiv2010

Local Quantum Measurement and No-Signaling Imply Quantum Correlations

We show that, assuming that quantum mechanics holds locally, the finite speed of information is the principle that limits all possible correlations between distant parties to be quantum mechanical as well. Local quantum mechanics means that a Hilbert space is assigned to each party, and then all local positive-operator-valued measurements are (in principle) available; however, the joint system is not necessarily described by a Hilbert space. In particular, we do not assume the tensor product formalism between the joint systems. Our result shows that if any experiment would give nonlocal correlations beyond quantum mechanics, quantum theory would be invalidated even locally.

quant-ph↗

arXiv2009

Necessary Condition for the Quantum Adiabatic Approximation

A gapped quantum system that is adiabatically perturbed remains approximately in its eigenstate after the evolution. We prove that, for constant gap, general quantum processes that approximately prepare the final eigenstate require a minimum time proportional to the ratio of the length of the eigenstate path to the gap. Thus, no rigorous adiabatic condition can yield a smaller cost. We also give a necessary condition for the adiabatic approximation that depends on local properties of the path, which is appropriate when the gap varies.

quant-ph↗

arXiv2009

Quantum state preparation by phase randomization

A computation in adiabatic quantum computing is implemented by traversing a path of nondegenerate eigenstates of a continuous family of Hamiltonians. We introduce a method that traverses a discretized form of the path: At each step we apply the instantaneous Hamiltonian for a random time. The resulting decoherence approximates a projective measurement onto the desired eigenstate, achieving a version of the quantum Zeno effect. If negative evolution times can be implemented with constant overhead, then the average absolute evolution time required by our method is O(L^2/Delta) for constant error probability, where L is the length of the path of eigenstates and Delta is the minimum spectral gap of the Hamiltonian. Making explicit the dependence on the path length is useful for cases where L does not depend on Delta. The complexity of our method has a logarithmic improvement over previous algorithms of this type. The same cost applies to the discrete-time case, where a family of unitary operators is given and each unitary and its inverse can be used. Restriction to positive evolution times incurs an error that decreases exponentially with the cost. Applications of this method to unstructured search and quantum sampling are considered. In particular, we discuss the quantum simulated annealing algorithm for solving combinatorial optimization problems. This algorithm provides a quadratic speed-up in the gap of the stochastic matrix over its classical counterpart implemented via Markov chain Monte Carlo.

quant-ph↗