Demonstrates a task solvable with 12 qubits but requiring 62-382 classical bits of memory, yielding unconditional quantum information supremacy on a trapped-ion processor.
Title resolution pending
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 7verdicts
UNVERDICTED 7roles
background 1polarities
background 1representative citing papers
Introduces a minimal matchgate circuit representation for fermionic Gaussian states together with a Yang-Baxter update algorithm, then maps out entanglement transitions in unitary circuit games under braiding and generic matchgate rules.
Develops an optimization-free disentangling algorithm and algebraic criterion for efficient CAMPS representations of Clifford circuits doped with αI+βP gates, enabling polynomial classical simulation for more circuits including typical N-T-gate random instances.
Thermal operations can generate nonstabiliser states from stabilizer states, with an analytic characterization for qubits and a general trade-off between attainable nonstabiliserness and initial free energy.
Provides a theoretical overview of Majorana-based topological quantum computing and introduces a time-dependent Pfaffian simulation method for braiding, projective measurements, and disorder.
Authors propose a low-optical-depth fusion-based photonic quantum computing architecture using quantum-dot emitters, adaptive repeat-until-success fusions, and time-bin qubits, with resource estimates and error-threshold simulations for fault tolerance.
Non-Hermitian and dissipative dynamics engineer magic steady states in qubits that attract every initial state to high-magic targets.
citing papers explorer
-
Demonstrating an unconditional separation between quantum and classical information resources
Demonstrates a task solvable with 12 qubits but requiring 62-382 classical bits of memory, yielding unconditional quantum information supremacy on a trapped-ion processor.
-
Disentangling strategies and entanglement transitions in unitary circuit games with matchgates
Introduces a minimal matchgate circuit representation for fermionic Gaussian states together with a Yang-Baxter update algorithm, then maps out entanglement transitions in unitary circuit games under braiding and generic matchgate rules.
-
Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states
Develops an optimization-free disentangling algorithm and algebraic criterion for efficient CAMPS representations of Clifford circuits doped with αI+βP gates, enabling polynomial classical simulation for more circuits including typical N-T-gate random instances.
-
Trading athermality for nonstabiliserness
Thermal operations can generate nonstabiliser states from stabilizer states, with an analytic characterization for qubits and a general trade-off between attainable nonstabiliserness and initial free energy.
-
Majorana braiding simulations with projective measurements
Provides a theoretical overview of Majorana-based topological quantum computing and introduces a time-dependent Pfaffian simulation method for braiding, projective measurements, and disorder.
-
Practical blueprint for low-depth photonic quantum computing with quantum dots
Authors propose a low-optical-depth fusion-based photonic quantum computing architecture using quantum-dot emitters, adaptive repeat-until-success fusions, and time-bin qubits, with resource estimates and error-threshold simulations for fault tolerance.
-
Magic Steady State Production: Non-Hermitian, Dissipative, and Stochastic Pathways
Non-Hermitian and dissipative dynamics engineer magic steady states in qubits that attract every initial state to high-magic targets.