A reduction framework from sample complexity yields matching time lower bounds for purity estimation, high-order functionals, productness testing, and related quantum protocols.
SIAM Journal on Computing , volume =
8 Pith papers cite this work, alongside 1,541 external citations. Polarity classification is still indexing.
8
Pith papers citing it
1,541
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Sdim is the first open-source qudit stabilizer simulator supporting all dimensions, enabling circuit evaluation and sampling for qudit fault-tolerant quantum computing research.
Quantum query complexity Q_LV(B_N) equals 2(N-1) for the hyperoctahedral group, twice the symmetric group value due to an ε-parity obstruction restricting the sign representation to even tensor powers.
A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.
New merge booster and diagonal detector components, combined with cache blocking and gate fusion, deliver up to 160x speedup on circuit benchmarks and 34x on diagonal-heavy gates versus prior simulators.
A review of the process matrix formalism for indefinite causal order in quantum theory, covering methodology, key results, experiments, and recent advances.
citing papers explorer
-
Quantum Time Lower Bounds by Permutation Invariance
A reduction framework from sample complexity yields matching time lower bounds for purity estimation, high-order functionals, productness testing, and related quantum protocols.
-
Sdim: A Qudit Stabilizer Simulator
Sdim is the first open-source qudit stabilizer simulator supporting all dimensions, enabling circuit evaluation and sampling for qudit fault-tolerant quantum computing research.
-
Quantum Query Complexity of the Hyperoctahedral Group
Quantum query complexity Q_LV(B_N) equals 2(N-1) for the hyperoctahedral group, twice the symmetric group value due to an ε-parity obstruction restricting the sign representation to even tensor powers.
-
Fault-tolerant quantum computation with a neutral atom processor
A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.
-
Large-Scale Quantum Circuit Simulation on HPC Cluster via Cache Blocking, Boosting, and Gate Fusion Optimization
New merge booster and diagonal detector components, combined with cache blocking and gate fusion, deliver up to 160x speedup on circuit benchmarks and 34x on diagonal-heavy gates versus prior simulators.
-
Indefinite Quantum Causality
A review of the process matrix formalism for indefinite causal order in quantum theory, covering methodology, key results, experiments, and recent advances.
- Computational Complexity of Model-Checking Quantum Pushdown Systems
- Probabilistic Computers (and Hence Quantum Computers) Are Rigorously More Powerful Than Classical Deterministic Computers, and Derandomization