{"total":16,"items":[{"citing_arxiv_id":"2605.19273","ref_index":69,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Implementation of Finite state logic machines via the dynamics of atomic systems","primary_cat":"quant-ph","submitted_at":"2026-05-19T02:40:38+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":3.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.13929","ref_index":30,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Linear-Time T-Gate Optimization via Random Abstraction","primary_cat":"cs.PL","submitted_at":"2026-05-13T15:54:13+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.10710","ref_index":11,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Communication-Efficient Distributed Inverse Quantum Fourier Transform","primary_cat":"quant-ph","submitted_at":"2026-05-11T15:22:03+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.06933","ref_index":51,"ref_count":2,"confidence":0.9,"is_internal_anchor":false,"paper_title":"MAGIQ: A Post-Quantum Multi-Agentic AI Governance System with Provable Security","primary_cat":"cs.LG","submitted_at":"2026-05-07T20:46:07+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.21892","ref_index":272,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"The impact of hydrogen atom tunneling on aromatic chemistry in TMC-1","primary_cat":"astro-ph.GA","submitted_at":"2026-04-23T17:44:06+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Hydrogen tunneling makes H-abstraction reactions by C2H, OH, and CN competitive in TMC-1 despite low individual rates, affecting aromatic abundance predictions.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.18186","ref_index":12,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Fundamentals and Applications of Hybrid Electro- and Opto-mechanical system coupled to Superconducting Qubit: A Short Review","primary_cat":"quant-ph","submitted_at":"2026-04-20T12:42:29+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":2.0,"formal_verification":"none","one_line_summary":"A review surveying coupling mechanisms in superconducting qubit-mechanical resonator hybrids and their extension to optomechanical architectures for quantum sensing applications.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"A400, 97-117 (1985) https://doi.org/ 10.1098/rspa.1985.0070 [10] Simon, D.R.: On the power of quantum computation. SIAM Journal on Computing26, 1474-1483 (1997) https://doi.org/10.1137/S0097539796298637 [11] Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete log- arithms on a quantum computer, 56-65 (1996) https://doi.org/10.1109/SFCS. 1996.548464 [12] Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. Proceedings 35th Annual Symposium on Foundations of Computer Science, 124-134 (1994) https://doi.org/10.1109/SFCS.1994.365700 [13] Cory, D.G., Fahmy, A.F., Havel, T.F.: Ensemble quantum computing by nmr spectroscopy. Proc. Natl. Acad. Sci.94, 1634-1639 (1997) https://doi."},{"citing_arxiv_id":"2604.02311","ref_index":40,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Space-Efficient Quantum Algorithm for Elliptic Curve Discrete Logarithms with Resource Estimation","primary_cat":"quant-ph","submitted_at":"2026-04-02T17:52:00+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2602.22388","ref_index":22,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Assessing student learning in quantum computing: The challenging case of phase kickback","primary_cat":"physics.ed-ph","submitted_at":"2026-02-25T20:34:31+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2602.15655","ref_index":3,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Generating quantum entanglement from sunlight","primary_cat":"quant-ph","submitted_at":"2026-02-17T15:30:09+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Sunlight produces polarization-entangled photons through SPDC, achieving concurrence 0.905, fidelity 0.939, and Bell violation S=2.54 exceeding the classical limit.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2512.01605","ref_index":6,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Resource Estimation for VQE on Small Molecules: Impact of Fermion Mappings and Hamiltonian Reductions","primary_cat":"quant-ph","submitted_at":"2025-12-01T12:24:00+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2508.00907","ref_index":6,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Prime Factorization Equation from a Tensor Network Perspective","primary_cat":"math.OC","submitted_at":"2025-07-29T10:38:51+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2505.06119","ref_index":2,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Tensor-Parallel Emulation of Quantum Circuits with Block-Cyclic Distributed Matrix Product States","primary_cat":"cs.DC","submitted_at":"2025-05-09T15:17:42+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2504.13532","ref_index":9,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Quantum Walks-Based Adaptive Distribution Generation with Efficient CUDA-Q Acceleration","primary_cat":"quant-ph","submitted_at":"2025-04-18T07:53:03+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Quantum walks integrated with variational circuits and CUDA-Q acceleration generate high-fidelity adaptive probability distributions for 1D financial modeling and 2D digit patterns.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2412.14061","ref_index":87,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Fast Byzantine Total Order Broadcast","primary_cat":"cs.DC","submitted_at":"2024-12-18T17:07:57+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2312.10054","ref_index":1,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Efficient Quantum Oracle for Solving Bilinear Diophantine Equations on Digital Quantum Computers","primary_cat":"physics.gen-ph","submitted_at":"2023-12-03T14:27:01+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2311.14344","ref_index":5,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","primary_cat":"quant-ph","submitted_at":"2023-11-24T08:41:02+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"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.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}