5 research outputs found
Analyzing Prospects for Quantum Advantage in Topological Data Analysis
Lloyd et al. were first to demonstrate the promise of quantum algorithms for
computing Betti numbers, a way to characterize topological features of data
sets. Here, we propose, analyze, and optimize an improved quantum algorithm for
topological data analysis (TDA) with reduced scaling, including a method for
preparing Dicke states based on inequality testing, a more efficient amplitude
estimation algorithm using Kaiser windows, and an optimal implementation of
eigenvalue projectors based on Chebyshev polynomials. We compile our approach
to a fault-tolerant gate set and estimate constant factors in the Toffoli
complexity. Our analysis reveals that super-quadratic quantum speedups are only
possible for this problem when targeting a multiplicative error approximation
and the Betti number grows asymptotically. Further, we propose a dequantization
of the quantum TDA algorithm that shows that having exponentially large
dimension and Betti number are necessary, but insufficient conditions, for
super-polynomial advantage. We then introduce and analyze specific problem
examples which have parameters in the regime where super-polynomial advantages
may be achieved, and argue that quantum circuits with tens of billions of
Toffoli gates can solve seemingly classically intractable instances.Comment: 54 pages, 7 figures. Added a number of theorems and lemmas to clarify
findings and also a discussion in the main text and new appendix about
variants of our problems with high Betti numbers that are challenging for
recent classical algorithm
Suppressing quantum errors by scaling a surface code logical qubit
Practical quantum computing will require error rates that are well below what
is achievable with physical qubits. Quantum error correction offers a path to
algorithmically-relevant error rates by encoding logical qubits within many
physical qubits, where increasing the number of physical qubits enhances
protection against physical errors. However, introducing more qubits also
increases the number of error sources, so the density of errors must be
sufficiently low in order for logical performance to improve with increasing
code size. Here, we report the measurement of logical qubit performance scaling
across multiple code sizes, and demonstrate that our system of superconducting
qubits has sufficient performance to overcome the additional errors from
increasing qubit number. We find our distance-5 surface code logical qubit
modestly outperforms an ensemble of distance-3 logical qubits on average, both
in terms of logical error probability over 25 cycles and logical error per
cycle ( compared to ). To investigate
damaging, low-probability error sources, we run a distance-25 repetition code
and observe a logical error per round floor set by a single
high-energy event ( when excluding this event). We are able
to accurately model our experiment, and from this model we can extract error
budgets that highlight the biggest challenges for future systems. These results
mark the first experimental demonstration where quantum error correction begins
to improve performance with increasing qubit number, illuminating the path to
reaching the logical error rates required for computation.Comment: Main text: 6 pages, 4 figures. v2: Update author list, references,
Fig. S12, Table I
Measurement-induced entanglement and teleportation on a noisy quantum processor
Measurement has a special role in quantum theory: by collapsing the
wavefunction it can enable phenomena such as teleportation and thereby alter
the "arrow of time" that constrains unitary evolution. When integrated in
many-body dynamics, measurements can lead to emergent patterns of quantum
information in space-time that go beyond established paradigms for
characterizing phases, either in or out of equilibrium. On present-day NISQ
processors, the experimental realization of this physics is challenging due to
noise, hardware limitations, and the stochastic nature of quantum measurement.
Here we address each of these experimental challenges and investigate
measurement-induced quantum information phases on up to 70 superconducting
qubits. By leveraging the interchangeability of space and time, we use a
duality mapping, to avoid mid-circuit measurement and access different
manifestations of the underlying phases -- from entanglement scaling to
measurement-induced teleportation -- in a unified way. We obtain finite-size
signatures of a phase transition with a decoding protocol that correlates the
experimental measurement record with classical simulation data. The phases
display sharply different sensitivity to noise, which we exploit to turn an
inherent hardware limitation into a useful diagnostic. Our work demonstrates an
approach to realize measurement-induced physics at scales that are at the
limits of current NISQ processors
Non-Abelian braiding of graph vertices in a superconducting processor
Indistinguishability of particles is a fundamental principle of quantum
mechanics. For all elementary and quasiparticles observed to date - including
fermions, bosons, and Abelian anyons - this principle guarantees that the
braiding of identical particles leaves the system unchanged. However, in two
spatial dimensions, an intriguing possibility exists: braiding of non-Abelian
anyons causes rotations in a space of topologically degenerate wavefunctions.
Hence, it can change the observables of the system without violating the
principle of indistinguishability. Despite the well developed mathematical
description of non-Abelian anyons and numerous theoretical proposals, the
experimental observation of their exchange statistics has remained elusive for
decades. Controllable many-body quantum states generated on quantum processors
offer another path for exploring these fundamental phenomena. While efforts on
conventional solid-state platforms typically involve Hamiltonian dynamics of
quasi-particles, superconducting quantum processors allow for directly
manipulating the many-body wavefunction via unitary gates. Building on
predictions that stabilizer codes can host projective non-Abelian Ising anyons,
we implement a generalized stabilizer code and unitary protocol to create and
braid them. This allows us to experimentally verify the fusion rules of the
anyons and braid them to realize their statistics. We then study the prospect
of employing the anyons for quantum computation and utilize braiding to create
an entangled state of anyons encoding three logical qubits. Our work provides
new insights about non-Abelian braiding and - through the future inclusion of
error correction to achieve topological protection - could open a path toward
fault-tolerant quantum computing
A multi-country test of brief reappraisal interventions on emotions during the COVID-19 pandemic.
The COVID-19 pandemic has increased negative emotions and decreased positive emotions globally. Left unchecked, these emotional changes might have a wide array of adverse impacts. To reduce negative emotions and increase positive emotions, we tested the effectiveness of reappraisal, an emotion-regulation strategy that modifies how one thinks about a situation. Participants from 87 countries and regions (n = 21,644) were randomly assigned to one of two brief reappraisal interventions (reconstrual or repurposing) or one of two control conditions (active or passive). Results revealed that both reappraisal interventions (vesus both control conditions) consistently reduced negative emotions and increased positive emotions across different measures. Reconstrual and repurposing interventions had similar effects. Importantly, planned exploratory analyses indicated that reappraisal interventions did not reduce intentions to practice preventive health behaviours. The findings demonstrate the viability of creating scalable, low-cost interventions for use around the world