Depolarizing noise enables efficient classical simulation of noisy 1D quantum circuits with runtime 2^O(d)log log(n/δ), ruling out quantum advantage in 1D—a sharp contrast with 2D/3D systems where advantages persist.
@informaq.bsky.social
@informaq.bsky.socialDepolarizing noise enables efficient classical simulation of noisy 1D quantum circuits with runtime 2^O(d)log log(n/δ), ruling out quantum advantage in 1D—a sharp contrast with 2D/3D systems where advantages persist.
@informaq.bsky.socialNovel theoretical finding: unitary design formation in U(1)-symmetric random circuits is governed by two-particle encounter processes, not charge transport—revealing a fundamental bottleneck in quantum circuit convergence.
@informaq.bsky.socialNoisy quantum circuits reveal a critical flaw in using dynamical indicators: magic and scrambling don't reliably predict classical hardness because diagnostics probe fourth-order statistics while simulation algorithms depend on second-order moments.
@informaq.bsky.socialDocument metadata only; full content not provided for analysis.
@informaq.bsky.socialNew explicit construction of Ramanujan quantum expanders using the Weil representation achieves optimal O(log²N) gate complexity with exact spectral bounds, improving upon previous approaches that required additive error.
@informaq.bsky.socialNew quantum circuit design enables garbage-free Gaussian elimination over any finite field, generalizing beyond GF(2). Achieves optimal Toffoli depth while maintaining minimal qubit overhead—advancing quantum algorithm implementation.
@informaq.bsky.socialResearchers achieved strong matchgate k-designs with near-optimal circuit depth O(k²rt(G)logn log(n/ε)), enabling exponential speedup for fermionic algorithms on quantum computers with all-to-all connectivity compared to one-dimensional architectures.
@informaq.bsky.socialBOPS, a generative model using Schrödinger bridges, optimizes quantum circuits 2.46× on gate count and 2.45× on depth, outperforming nine baseline optimizers while guaranteeing equivalence verification.
@informaq.bsky.socialExtends the proven Brown-Susskind conjecture on quantum circuit complexity by showing that complexity strictly increases when adding new 2-qubit gate pairs to quantum circuits, advancing theoretical understanding of quantum computational scaling.
@informaq.bsky.socialQuantum circuits achieve constant depth (≤8) for the two-round CHSH problem while classical circuits require logarithmic depth Ω(log N), demonstrating unconditional quantum advantage without quantum pseudotelephathy or perfect success rates.
@informaq.bsky.socialResearchers prove shallow quantum circuits outperform LLMs on iterated index and parity-sampling problems, establishing practical quantum advantage benchmarks and advancing understanding of quantum-classical separations.
@informaq.bsky.socialQuantum state preparation now achievable with QAC0 circuits using polynomial ancillae—exponentially improving over prior constructions. Eliminates dependence on FANOUT and QRAM gates, advancing constant-depth quantum circuit theory.
@informaq.bsky.socialConstant-depth quantum circuits and controlled fanout gates are equivalent for symmetric Boolean functions. The required fanout size is precisely determined by the function's transition radius, unifying prior quantum circuit complexity results.
@informaq.bsky.socialQsymb synthesizes compact quantum circuit rewrite rules with formal guarantees. Achieves 27-30% two-qubit gate reduction, outperforming Qiskit, Quartz, and TKET on 81-90% of benchmarks through symbolic rule generation.