{"total":30,"items":[{"citing_arxiv_id":"2607.01323","ref_index":18,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Noisy quantum circuit simulation with the tensor jump method","primary_cat":"quant-ph","submitted_at":"2026-07-01T18:00:01+00:00","verdict":"ACCEPT","verdict_confidence":"HIGH","novelty_score":6.0,"formal_verification":"none","one_line_summary":"cTJM combines local TDVP MPS gate evolution with variance-aware Pauli-Lindblad jump sampling, cutting trajectory variance and bond growth on noisy circuits up to 127 qubits.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.28313","ref_index":32,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Diameter truncated operator evolution","primary_cat":"quant-ph","submitted_at":"2026-06-26T17:56:45+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Diameter truncation of operators provides an efficient approximation for simulating local dynamics and transport in out-of-equilibrium quantum many-body systems.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.20441","ref_index":11,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Computing noise-canceling observables via Pauli propagation","primary_cat":"quant-ph","submitted_at":"2026-06-18T16:22:51+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Hybrid framework combines Pauli propagation with noise-canceling channels to compute observables more accurately on quantum hardware with lower classical and quantum resource costs.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.18515","ref_index":105,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Exponentially many initializations to avoid barren plateaus","primary_cat":"quant-ph","submitted_at":"2026-06-16T22:07:17+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A first-moment operator diagnostic reveals exponentially many inequivalent initialization distributions avoid barren plateaus in variational quantum algorithms, with numerics indicating distinct attained minima.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.09773","ref_index":66,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"From Pauli Strings to Quantum Dynamics: A Unified Characterization","primary_cat":"quant-ph","submitted_at":"2026-06-08T17:33:15+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Develops an invariant-based framework connecting Pauli Lie algebras to transvection-generated Clifford subgroups for quantum reachability and dynamics analysis.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.05311","ref_index":63,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Setting angles in quantum approximate optimization at utility-scale","primary_cat":"quant-ph","submitted_at":"2026-06-03T18:02:26+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":3.0,"formal_verification":"none","one_line_summary":"The paper benchmarks approximation techniques and transfer learning for setting QAOA angles at utility scale and extracts operational guidance from hardware-validated results.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.01922","ref_index":16,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Half the Interference, Most of the Answer: Approximate Quantum Simulation via Path-Sum Pruning","primary_cat":"quant-ph","submitted_at":"2026-06-01T08:57:44+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Statistical interference sampling using a Chemical Abstract Machine model prunes nearly 50% of endpoint interference reactions while retaining over 90% output accuracy on Deutsch-Jozsa, Grover, Simon, and small Shor instances.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.25974","ref_index":10,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"PauLIB: A High-Performance Library for Processing Pauli Strings","primary_cat":"quant-ph","submitted_at":"2026-05-25T15:48:14+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"PauLIB implements a compact bit-packed symplectic representation and SoA layout for Pauli strings, delivering 14x–21,000x speedups and 7.3x memory reduction versus existing Python frameworks at 500 qubits.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.23377","ref_index":49,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"SAFE ma-QAOA: Surrogate-Assisted and Fine-Tuning Enhanced Multi-Angle QAOA with Parameter Distillation","primary_cat":"quant-ph","submitted_at":"2026-05-22T08:43:07+00:00","verdict":"CONDITIONAL","verdict_confidence":"MODERATE","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Combining a truncated classical surrogate, angle pruning, and exact fine-tuning cuts the number of active angles and estimated fine-tuning cost of ma-QAOA on small spin-glass and Max-Cut instances while preserving near-optimal approximation ratios.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.21447","ref_index":60,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Combining non-parametric quantum states and MERA tensor networks for ground-state optimization","primary_cat":"quant-ph","submitted_at":"2026-05-20T17:35:43+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A hybrid method uses fixed quantum annealing states as boundary resources for classical MERA tensor networks to improve ground-state approximations without deeper quantum circuits.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.18985","ref_index":60,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Efficient Fourier-Based Linear Combination of Unitaries and Applications in Quantum Optimization","primary_cat":"quant-ph","submitted_at":"2026-05-18T18:05:08+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Fourier-based LCU decomposes diagonal and non-diagonal unitaries into hardware-friendly forms for QAOA-style optimization, trading circuit depth for sampling overhead with performance guarantees.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.18943","ref_index":34,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Noise-induced Simulability Transition from Operator Scrambling","primary_cat":"quant-ph","submitted_at":"2026-05-18T18:00:00+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Above a critical noise strength, operator scrambling in random circuits is suppressed leading to classical simulability; below it, simulation stays exponentially hard.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.17067","ref_index":55,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Near-Optimal Quantum Time Evolution Circuits via Provably Convergent Compression","primary_cat":"quant-ph","submitted_at":"2026-05-16T16:35:09+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A recipe for initial points in variational compression of quantum time-evolution operators that provably converges to near-optimal O(N t polylog(N t/ε)) gate complexity for local translationally invariant Hamiltonians.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.04540","ref_index":31,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Hierarchical entanglement transitions and hidden area-law sectors in quantum many-body dynamics","primary_cat":"quant-ph","submitted_at":"2026-05-06T06:40:58+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Local quenches in chaotic quantum systems produce a Renyi-index-tuned hierarchy of entanglement transitions, with S_alpha>1 obeying area law while S_alpha<=1 is volume-law, carried by an O(1)-dimensional dominant Schmidt sector that itself exhibits similar transitions at lower critical indices.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.04025","ref_index":32,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Fast, accurate, high-resolution simulation of large-scale Fermi-Hubbard models on a digital quantum processor","primary_cat":"quant-ph","submitted_at":"2026-05-05T17:49:07+00:00","verdict":"CONDITIONAL","verdict_confidence":"MODERATE","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A 120-qubit digital simulation of 1D Fermi-Hubbard dynamics on IBM hardware matches TDVP tensor-network results to ~1% RMSE up to t≈5.2, with a large wall-clock speedup at the point of divergence.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.02995","ref_index":19,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Page Curve for Local-Operator Entanglement from Free Probability","primary_cat":"quant-ph","submitted_at":"2026-05-04T18:00:00+00:00","verdict":null,"verdict_confidence":null,"novelty_score":null,"formal_verification":null,"one_line_summary":null,"context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.27049","ref_index":14,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Non-Local Magic Resources for Fermionic Gaussian States","primary_cat":"quant-ph","submitted_at":"2026-04-29T18:00:00+00:00","verdict":null,"verdict_confidence":null,"novelty_score":null,"formal_verification":null,"one_line_summary":null,"context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"Vedral, Rev. Mod. Phys.80, 517 (2008). [11] L. Leone, S. F. E. Oliviero, and A. Hamma, Phys. Rev. Lett.128, 050402 (2022). [12] L. Leone and L. Bittel, Phys. Rev. A110, L040403 (2024). [13] X. Huang, H.-Z. Li, and J.-X. Zhong, A fast and exact 15 approach for stabilizer rényi entropy via the xor-fwht algorithm (2026), arXiv:2512.24685 [quant-ph]. [14] Z. Xiao and S. Ryu, Exponentially accelerated sam- pling of pauli strings for nonstabilizerness (2026), arXiv:2601.00761 [quant-ph]. [15] P. Sierant, J. Vallès-Muns, and A. Garcia-Saez, Computing quantum magic of state vectors (2026), arXiv:2601.07824 [quant-ph]. [16] L. Bittel and L. Leone, Quantum10, 2069 (2026). [17] D. Iannotti, L. Campos Venuti, and A."},{"citing_arxiv_id":"2604.17630","ref_index":78,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Randomized Subsystem Descent for Fermion-to-Qubit Mapping","primary_cat":"quant-ph","submitted_at":"2026-04-19T21:55:39+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Randomized Subsystem Descent reduces weighted Pauli weight in fermion-to-qubit mappings for Hubbard models up to 16x16 sites and molecular Hamiltonians with 54 modes.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.16720","ref_index":58,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Quantum many-body operator cascade as a route to chaos","primary_cat":"cond-mat.stat-mech","submitted_at":"2026-04-17T21:47:40+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Local operators in quantum chaotic systems cascade toward non-local fractal structures whose dimension is tied by unitarity to the decay rate of local correlations, demonstrated exactly in dual-unitary circuits and numerically in others.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.16701","ref_index":105,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Enabling Lie-Algebraic Classical Simulation beyond Free Fermions","primary_cat":"quant-ph","submitted_at":"2026-04-17T21:05:34+00:00","verdict":"ACCEPT","verdict_confidence":"HIGH","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Symmetry-adapted Pauli-orbit and modified Gell-Mann bases make polynomial-dimensional dynamical Lie algebras practically simulable beyond free fermions.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"putation, the gottesman-knill theorem, and slightly be- yond (2009), arXiv:0811.0898 [quant-ph]. [103] S. Bravyi, D. Gosset, and Y. Liu, How to simulate quan- tum measurement without computing marginals, Phys- ical Review Letters128, 220503 (2022). [104] S. Bravyi, D. Gosset, and R. Movassagh, Classical al- gorithms for quantum mean values, Nat. Phys.17, 337 (2021). [105] M. S. Rudolph, T. Jones, Y. Teng, A. Angrisani, and Z. Holmes, Pauli propagation: A computational framework for simulating quantum systems (2025), arXiv:2505.21606 [quant-ph]. [106] A. Chapman and S. T. Flammia, Characterization of solvable spin models via graph invariants, Quantum4, 278 (2020). [107] A. Chapman, S. J. Elman, and R. L. Mann, A unified"},{"citing_arxiv_id":"2604.08467","ref_index":18,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Accelerating Quantum Tensor Network Simulations with Unified Path Variations and Non-Degenerate Batched Sampling","primary_cat":"quant-ph","submitted_at":"2026-04-09T17:02:18+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"New techniques for error-independent unified path variation, non-degenerate batched sampling, and flexible contraction accelerate tensor network quantum trajectory simulations by more than 10^8 times.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"[12], [13]. Various alternative methods of quantum simulation that do not inherently scale exponentially withnexist, such as Clifford [14], Near-Clifford [15], [16], PauliProp [17], and oth- ers (see Sec. II-A for a more complete discussion), but tensor networks are arguably the oldest and most general alternative to universal statevector simulations [18]. In particular, they can carry out efficient, exact simulations in systems where there are relatively many qubits and few quantum gates (quantum logical operations), as unlike statevectors, their complexity grows only polynomially in the former, albeit exponentially in the latter [19]. However, the complexity of tensor network simulations also greatly increases when moving from the"},{"citing_arxiv_id":"2604.04778","ref_index":39,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"QCommute: a tool for symbolic computation of nested commutators in quantum many-body spin-1/2 systems","primary_cat":"cond-mat.str-el","submitted_at":"2026-04-06T15:52:18+00:00","verdict":"ACCEPT","verdict_confidence":"HIGH","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A new open-source C++ package computes nested commutators [H,[H,...A]] exactly and symbolically in the thermodynamic limit for spin-1/2 hypercubic lattices.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"org, Accessed: 2026-04-08. [37]M. S. Rudolph, T . Jones, Y. Teng, A. Angrisani and Z. Holmes,Pauli propagation: A com- putational framework for simulating quantum systems, arXiv preprint arXiv:2505.21606 (2025). [38]T . Beguši'c,Sparse Pauli Dynamics (SPD) Python implementation, https://github.com/ tbegusic/spd/tree/main/spd, Accessed: 2026-03-25. [39]J. Roldan, B. M. McCoy and J. H. Perk,Dynamic spin correlation functions of the xyz chain at infinite temperature: A study based on moments, Physica A: Statistical Mechanics and its Applications136(2), 255 (1986), doi:https://doi.org/10.1016/0378-4371(86)90254- 2. [40]J. Florencio, S. Sen and Z. Cai,Quantum spin dynamics of the transverse ising model in two dimensions, Journal of Low Temperature Physics89, 561 (1992),"},{"citing_arxiv_id":"2604.02584","ref_index":103,"ref_count":2,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Fermionic mean-field dynamics for spin systems beyond free fermions","primary_cat":"cond-mat.str-el","submitted_at":"2026-04-02T23:41:06+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"fTDHF extends time-dependent Hartree-Fock to fermionized spin-1/2 Hamiltonians, remaining exact for free fermions while handling non-local strings via non-orthogonal Slater determinant transitions and reproducing qualitative dynamics in three benchmark models.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2603.24654","ref_index":109,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Spectral methods: crucial for machine learning, natural for quantum computers?","primary_cat":"quant-ph","submitted_at":"2026-03-25T18:00:00+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Quantum computers may enable more natural manipulation of Fourier spectra in ML models via the Quantum Fourier Transform, potentially leading to resource-efficient spectral methods.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"cient is no small task. Quantum computers offer a very particular access to information via measurement. For example, generative quantum models can fundamentally not estimate likelihoods of the sampling distribution, whereas classical generative models (besides GANs) can be understood as a collection of ingenious, technical, and non-obvious tricks to do exactly that [109]. Quantum Fourier Transforms do not enable us todirectly compute the Fourier coefficients of a quantum state, we can only manipulate them within the limits of quantum algorith- mic tools, or sample from the spectrum. And, while a fundamental building block for even fault-tolerant quan- tum machine learning algorithms, training parametrised circuits is by no means the silver bullet that neural net-"},{"citing_arxiv_id":"2603.14670","ref_index":85,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Computing logical error thresholds with the Pauli Frame Sparse Representation","primary_cat":"quant-ph","submitted_at":"2026-03-15T23:54:37+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A new sparse Pauli-frame method shows coherent noise thresholds are overestimated by a factor of ~4 under Pauli-twirling and revises the T-to-S gate error rate factor to as high as 7 at distance d=5.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2601.02233","ref_index":4,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"PauliEngine: High-Performant Symbolic Arithmetic for Quantum Operations","primary_cat":"quant-ph","submitted_at":"2026-01-05T16:00:44+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"PauliEngine delivers a high-performance C++ backend for Pauli string multiplication, commutators, and symbolic tracking that outperforms existing tools in benchmarks.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2509.13528","ref_index":99,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"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":"2503.24362","ref_index":34,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Recursion method for quench dynamics: strengths and limitations","primary_cat":"cond-mat.str-el","submitted_at":"2025-03-31T17:43:09+00:00","verdict":null,"verdict_confidence":null,"novelty_score":null,"formal_verification":null,"one_line_summary":null,"context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2502.04271","ref_index":4,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"Variational decision diagrams for quantum-inspired machine learning applications","primary_cat":"quant-ph","submitted_at":"2025-02-06T18:09:08+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"The paper proposes variational decision diagrams (VDDs) for quantum state representation in QML and reports successful training without barren plateaus on transverse-field Ising and Heisenberg Hamiltonians.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2411.10406","ref_index":58,"ref_count":1,"confidence":0.9,"is_internal_anchor":true,"paper_title":"How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits","primary_cat":"quant-ph","submitted_at":"2024-11-15T18:22:46+00:00","verdict":"ACCEPT","verdict_confidence":"MODERATE","novelty_score":4.0,"formal_verification":"none","one_line_summary":"A comprehensive review of scaling paths for superconducting quantum computers, with resource and sensitivity analyses for utility-scale applications under realistic error distributions.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"heuristic quantum algorithms. 3. Challenges at 10k-100k physical qubits At the very large scale, circuit-level scaling challenges be- come significant [25, Table 1], including verification, testing, and debugging. For conventional integrated circuits, the chal- lenge of \"dark silicon\" arises, where a significant fraction of the chip performs various service roles [58]. In quantum com- puting, FTQC creates a similar overhead. FTQC overhead. A major challenge at this scale is re- ducing the cross-talk noise and two-qubit gate errors. Unfa- vorable scaling of accumulated errors can increase the over- head of QECCs needed to compensate for them, further un- dermining quantum advantage. This issue is the focus of our"}],"limit":50,"offset":0}