Introduces forward-assisted purification via a new spatiotemporal framework that outperforms conventional static purification by up to 50x in copy efficiency and circumvents no-purification theorems for Bell states.
hub
In: Pro- ceedings 35th Annual Symposium on Foundations of Computer Science, pp
20 Pith papers cite this work. Polarity classification is still indexing.
20
Pith papers citing it
hub tools
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
A randomized linear-time phase-folding algorithm using constant-width bitstring abstraction optimizes T-count in quantum circuits orders of magnitude faster than prior tools while achieving comparable reductions.
Flutter achieves 2Δ + ε good-case latency for Byzantine Total Order Broadcast via a new binary consensus called Blink, under partial synchrony with 5f+1 servers.
A pruned distributed inverse quantum Fourier transform reduces inter-node communication from quadratic to linear scaling in the number of nodes while preserving functional correctness.
A space-efficient quantum ECDLP algorithm uses 5n + 4⌊log₂n⌋ + O(1) logical qubits and O(n³) Toffoli gates, lowering the 256-bit estimate from 2124 to 1333 qubits.
Sunlight produces polarization-entangled photons through SPDC, achieving concurrence 0.905, fidelity 0.939, and Bell violation S=2.54 exceeding the classical limit.
Presents an exact tensor-network equation and optimized algorithm for integer factorization by tensorizing a multiplication circuit and contracting it to match a target composite number.
Presents a tensor-parallel distributed MPS method with block-cyclic partitioning and pivoted QR that emulates Google's RCS benchmark at bond dimension 16384 on 32 nodes, claiming three orders of magnitude better accuracy than prior methods.
A tensor-network encoding of TSP tours with Boltzmann weighting and explicit constraint filters that supplies a marginal formula for optimal tours in the zero-temperature exact limit.
Demonstration of dual-chip InP-SiN time-bin BB84 QKD system with QBER below 4% and kbps secret key rates over 150-250 km fiber using finite-key security analysis.
MAGIQ introduces a post-quantum governance system for multi-agent AI that supports policy budgets, session enforcement, message attribution, and UC-based security proofs while comparing overhead to SAGA.
Hydrogen tunneling makes H-abstraction reactions by C2H, OH, and CN competitive in TMC-1 despite low individual rates, affecting aromatic abundance predictions.
Presents a concrete quantum oracle for bilinear Diophantine equations enabling factoring of n-bit biprimes with 2n-5 qubits or fewer and near-100% simulated success for numbers up to 35 bits.
Detailed revision of a single phase-kickback item on a quantum computing survey reveals complex student reasoning and supports triangulating multiple data types when building conceptual assessments.
Fermion mappings combined with Z2 tapering and frozen-core approximations reduce qubit counts by up to 50%, gate counts by up to 27.5x, and Pauli strings by up to 2.75x for VQE on small molecules.
Quantum walks integrated with variational circuits and CUDA-Q acceleration generate high-fidelity adaptive probability distributions for 1D financial modeling and 2D digit patterns.
A conceptual proposal to implement finite-state classical logic machines by mapping Boolean operations onto the population and coherence dynamics of a two-level atomic system analyzed via the Liouville equation.
A literature review of authentication in quantum networks concludes that it is not an intrinsic limitation but depends on explicit resources and deployment assumptions.
Software platform for hybrid LFSR-MT PRNG generation and ML-based predictability analysis, reporting inherent limitations in classical generators versus quantum randomness.
A review surveying coupling mechanisms in superconducting qubit-mechanical resonator hybrids and their extension to optomechanical architectures for quantum sensing applications.
citing papers explorer
-
Fast Byzantine Total Order Broadcast
Flutter achieves 2Δ + ε good-case latency for Byzantine Total Order Broadcast via a new binary consensus called Blink, under partial synchrony with 5f+1 servers.