{"total":16,"items":[{"citing_arxiv_id":"2606.13481","ref_index":29,"ref_count":2,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Towards a Control interpretation of Quantum Advantage","primary_cat":"math.OC","submitted_at":"2026-06-11T15:31:26+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"The paper proposes identifying quantum advantage with the existence of a polynomial-in-n upper bound on the minimal time to achieve operator controllability for bilinear quantum control systems on SU(N).","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.08707","ref_index":46,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Simulating quantum circuits with a neural statebank","primary_cat":"quant-ph","submitted_at":"2026-06-07T16:05:44+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A compact neural statebank based on autoregressive Transformers simulates 34-qubit quantum circuits with ~0.01 infidelity using 0.3 million parameters, outperforming tested approximate simulators.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.07084","ref_index":26,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Projector Quantum Variational Ansatz","primary_cat":"quant-ph","submitted_at":"2026-06-05T09:23:56+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"The Projector Variational Ansatz (PVA) is a new VQE ansatz that can match ISQ-QSP or ADAPT-VQE structures and converges with shallower circuits than standard ADAPT-VQE in experiments.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.02721","ref_index":15,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Simulating Condensed Matter Physics on Quantum Hardware","primary_cat":"cond-mat.str-el","submitted_at":"2026-06-01T18:00:07+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":2.0,"formal_verification":"none","one_line_summary":"A survey of quantum hardware platforms and methods for simulating condensed matter physics, covering ground states, topology, non-equilibrium dynamics, and the role of noisy devices as prototypes for fault-tolerant simulation.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.22758","ref_index":2,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"A sharp interaction-degree threshold for simulating QAOA","primary_cat":"quant-ph","submitted_at":"2026-05-21T17:24:00+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"There is a sharp threshold at interaction degree 3 where classical sampling from depth-1 QAOA becomes hard enough to collapse the polynomial hierarchy, contrasting with efficient simulation at degree 2 for logarithmic depth.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.11375","ref_index":21,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"TuniQ: Autotuning Compilation Passes for Quantum Workloads at Scale for Effectiveness and Efficiency","primary_cat":"quant-ph","submitted_at":"2026-05-12T00:58:42+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"TuniQ uses RL with a dual-encoder, shaped rewards, and action masking to autotune quantum compilation passes, improving fidelity and speed over Qiskit while generalizing across backends and scaling to large circuits.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"grams, expressed as circuits, cannot execute directly on hardware: different devices support different native gate sets, and multi-qubit operations are restricted to physically adjacent qubits [39, 47]. A compilation step, calledtranspilation, transforms a logical circuit into a hardware-executable physical circuit and runs on classical HPC resources such as GPU clusters [21, 74] and multi-core nodes. Beyond satisfying hardware constraints, compilation determines theruntime and depthof quantum execution and which physical qubits execute each operation [72]. Runtime is a first-order concern for near-term devices and also for fault-tolerant quantum comput- ing (FTQC). Quantum error correction (QEC) incurs substantial overhead, and early FTQC systems will rely on shallow logical cir-"},{"citing_arxiv_id":"2604.20088","ref_index":3,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"CVaR-Assisted Custom Penalty Function for Constrained Optimization","primary_cat":"quant-ph","submitted_at":"2026-04-22T01:08:38+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A nonlinear custom penalty without slack variables plus CVaR sampling improves optimality gaps and consistency on knapsack instances for quantum constrained optimization.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.16718","ref_index":35,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Potential Energy Savings from Quantum Computing-Based Route Optimization","primary_cat":"cs.ET","submitted_at":"2026-04-17T21:37:07+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"QAOA achieves approximation ratios of 0.90-0.95 on N=5-20 Euclidean graphs, outperforming classical baselines by 2.7-4.4% with 2-3x faster runtimes and picojoule-scale energy use, projecting 8.2% real-world routing efficiency gains and 2.62 EJ annual US fuel savings.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.08367","ref_index":9,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Per-Shot Evaluation of QAOA on Max-Cut: A Black-Box Implementation Comparison with Goemans-Williamson","primary_cat":"quant-ph","submitted_at":"2026-04-09T15:33:37+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"QAOA with default parameters is compared per-shot to Goemans-Williamson on realistic Max-Cut instances, highlighting practical limitations under black-box use.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"[7] Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 (2014) https://doi.org/10.48550/arXiv.1411.4028 [8] Crooks, G.E.: Performance of the quantum approximate optimiza tion algo- rithm on the maximum cut problem. arXiv preprint arXiv:1811.08419 (2 018) https://doi.org/10.48550/arXiv.1811.08419 [9] Farhi, E., Harrow, A.W.: Quantum supremacy through the quantu m approximate optimization algorithm. arXiv preprint arXiv:1602.07674 (2016) https://doi.org/10.48550/arXiv.1602.07674 [10] Hadfield, S.: Quantum Algorithms for Scientific Computing. Columb ia University, New York, NY (2018). https://doi.org/10.48550/arXiv.1805.03265 [11] Shaydulin, R., Li, C."},{"citing_arxiv_id":"2601.01516","ref_index":51,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Constraint-Aware Quantum Optimization via Hamming Weight Operators","primary_cat":"quant-ph","submitted_at":"2026-01-04T12:58:04+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"Hamming Weight Operators and an adaptive QAOA variant confine evolution to feasible states by construction, delivering faster convergence and roughly half the gate count versus penalty methods on finance and physics tasks.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2510.19928","ref_index":141,"ref_count":4,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Mind the gaps: The fraught road to quantum advantage","primary_cat":"quant-ph","submitted_at":"2025-10-22T18:00:19+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":3.0,"formal_verification":"none","one_line_summary":"The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.","context_count":2,"top_context_role":"background","top_context_polarity":"support","context_text":"FASQ machines might realize that kind of advantage, but they face similar challenges to those confronting NISQ computers, such as barren plateaus and suboptimal local minima. It is known that directly simulating QAOA is classically hard [140], but also that log-depth QAOA does not have an asymptotic quantum advantage for a large class of sparse combinatorial optimization problems [141, 142] (which does not rule out a practically useful advantage at modest depth). As an existence proof, one can construct examples of asymptotic quantum ad- vantage in finding approximate solutions to some optimization problems such as integer programming [ 143-145]. This is done by mapping problems solvable via Shor's algorithm to optimization tasks, and then invoking notions of computational"},{"citing_arxiv_id":"2510.08153","ref_index":12,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Going off Pattern? QAOA Parameter Heuristics and Potentials of Parsimony","primary_cat":"quant-ph","submitted_at":"2025-10-09T12:35:30+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Numerical experiments on QAOA show optimal parameters often break expected patterns, performance becomes less parameter-sensitive with depth, and component-wise iterative fixing performs competitively or better at low depth.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2510.02141","ref_index":25,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Quantum speed-up for solving the one-dimensional Hubbard model using quantum annealing","primary_cat":"quant-ph","submitted_at":"2025-10-02T15:49:36+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Classical simulation of quantum annealing for the 1D Hubbard model up to 40 qubits reports substantial speed-up over Bethe-ansatz methods for half-filled cases.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2509.13528","ref_index":7,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","primary_cat":"quant-ph","submitted_at":"2025-09-16T20:48:53+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Systematic numerical study of QAOA parameter transfer on heavy-hex Ising models with local cubic terms shows transferred angles from small instances yield improving expectation values up to 49 layers on instances up to 156 qubits, with hardware runs confirming gains up to p=10.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2508.21122","ref_index":59,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Quantum algorithms for equational reasoning","primary_cat":"quant-ph","submitted_at":"2025-08-28T18:00:06+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Presents a quantum Hamiltonian whose ground state encodes equivalence classes of expressions, enabling verification, counting, and structural queries on instances far beyond classical reach.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2501.04776","ref_index":14,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX","primary_cat":"quant-ph","submitted_at":"2025-01-08T19:00:02+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"IQPopt is a JAX-based software tool enabling classical optimization of IQP circuits with thousands of qubits via efficient simulation of Pauli-Z expectation values, plus a module for quantum generative model training.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}