{"total":13,"items":[{"citing_arxiv_id":"2605.21662","ref_index":46,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Fidelity-Aware Frequency Allocation and Transpilation Co-Design for Tunable Coupler Quantum Systems","primary_cat":"quant-ph","submitted_at":"2026-05-20T19:13:50+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A co-design method for frequency allocation and noise-aware transpilation in tunable-coupler quantum systems yields 8.9% lower log-infidelity cost and 6.8% shorter circuits than SABRE on SNAIL architectures.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.08675","ref_index":120,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Quantum resource reduction for quantum-centric supercomputing via correlated mean-field downfolding framework","primary_cat":"quant-ph","submitted_at":"2026-05-09T04:22:32+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"OBDF-SQD uses classical OBMP2 downfolding to create an effective active-space Hamiltonian with unchanged operator structure, then applies SQD to improve accuracy over standard CAS-SQD on H6 and N2 dissociation curves without extra quantum circuit cost.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.26314","ref_index":41,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Amplitude Encoding of Slater-Type Orbitals via Matrix Product States: Efficient State Preparation and Integral Evaluation on Quantum Hardware","primary_cat":"quant-ph","submitted_at":"2026-04-29T05:51:12+00:00","verdict":"CONDITIONAL","verdict_confidence":"MODERATE","novelty_score":8.0,"formal_verification":"none","one_line_summary":"Matrix product states allow amplitude encoding of Slater-type orbitals with constant bond dimension in one dimension and saturating entanglement in three dimensions, supporting low-error integral evaluation on quantum processors.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.23777","ref_index":27,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Architecture-aware Unitary Synthesis","primary_cat":"quant-ph","submitted_at":"2026-04-26T16:01:45+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A new method for unitary synthesis on quantum hardware cuts CNOT gates by up to 36% and compiles up to 553 times faster than standard tools on square and heavy-hex lattices.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"This work was funded by the Business Finland Quantum Computing Cam- paign: The Enhanced Middleware for Quantum Systems (EM4QS) project. process of initializing a quantum register into a desired quan- tum state, relies on the synthesizing unitary matrices into quantum circuits, and is a crucial subroutine in algorithms such as quantum machine learning [27], amplitude estimation [6], and variational quantum eigensolvers [24]. Quantum signal processing (QSP) and its generalization, the quantum singular value transformation (QSVT) [13], unify a broad class of quantum algorithms by applying polynomial transformations to block-encoded matrices, often requiring the implementation of carefully constructed unitary operators."},{"citing_arxiv_id":"2604.20912","ref_index":59,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Quantum-HPC Software Stacks and the openQSE Reference Architecture: A Survey","primary_cat":"quant-ph","submitted_at":"2026-04-22T01:56:58+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"A survey of nine QHPC stacks identifies common patterns and proposes the openQSE reference architecture to unify interfaces for interoperability in quantum-HPC environments.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"reference architecture also outlines future phases with more tightly integrated execution models, including near-time coupling and support for outer decoders. 8 5.3 Stack 3: IonQ IonQ provides access to trapped-ionQPU resources through itsQuantum Platform[37, 49], which spans scheduling, compilation, tenant management, and observability. It integrates with Qiskit [59], CUDA-Q [26], and PennyLane [57] SDKs. The primary deployment model is cloud-managed; on-premises and federated access pathways are emerging viaQDMI [69] and QRMI [61] plugin implementations [48]. Scheduling is multi-tiered [48]: a platform tier manages tenant allocations via proportional fair-share; a QPU tier interleaves user jobs with calibrations, which consume accountableQPU"},{"citing_arxiv_id":"2604.17519","ref_index":29,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Isolating Recurring Execution-Dependent Abnormal Patterns on NISQ Quantum Devices","primary_cat":"cs.SE","submitted_at":"2026-04-19T16:21:46+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"QRisk isolates backend-specific abnormal error patterns on NISQ devices via delta debugging and mitigates them with commuting gate swaps, cutting excess noise by 24-45% on IBM backends where noise models predict no difference.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"work: quantum program testing and debugging, hardware noise characterization, noise-aware compilation, and delta debugging. Quantum program testing and debugging.Several lines of work address fault detection and localization in quan- tum programs, including assertion-based checking, meta- morphic testing [1, 26], differential testing [40], and failure localization [7, 21, 31]. Ramalho et al. [29] survey the field. These techniques aim to diagnose faults in a single program or execution.QRiskshares the goal of reducing anomalous behavior to interpretable evidence, but uses the result differ- ently: the output is not a bug report but a reusable pattern database that guides future compilation. Hardware noise characterization.Calibration data, pro-"},{"citing_arxiv_id":"2604.12256","ref_index":31,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Large-Scale Quantum Circuit Simulation on HPC Cluster via Cache Blocking, Boosting, and Gate Fusion Optimization","primary_cat":"quant-ph","submitted_at":"2026-04-14T04:07:24+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":3.0,"formal_verification":"none","one_line_summary":"New merge booster and diagonal detector components, combined with cache blocking and gate fusion, deliver up to 160x speedup on circuit benchmarks and 34x on diagonal-heavy gates versus prior simulators.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"Love, Alán Aspuru-Guzik, and Jeremy L. O'Brien. 2014. A variational eigenvalue solver on a photonic quantum processor.Nature Communications5, 1 (July 2014). doi:10.1038/ncomms5213 [30] Vicente Pina-Canelles, Adrian Auer, and Inés de Vega. 2025. Improving and benchmarking NISQ qubit routers. arXiv:2502.03908 [quant-ph] https://arxiv. org/abs/2502.03908 [31] Qiskit contributors. 2023. Qiskit: An Open-source Framework for Quantum Computing. doi:10.5281/zenodo.2573505 [32] Mikhail Smelyanskiy, Nicolas P. D. Sawaya, and Alán Aspuru-Guzik. 2016. qHiPSTER: The Quantum High Performance Software Testing Environment. arXiv:1601.07195 [quant-ph] [33] Robert S. Smith, Michael J. Curtis, and William J. Zeng. 2017."},{"citing_arxiv_id":"2604.08180","ref_index":26,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Quantum Computing for Financial Transformation: A Review of Optimisation, Pricing, Risk, Machine Learning, and Post-Quantum Security","primary_cat":"q-fin.CP","submitted_at":"2026-04-09T12:35:53+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":2.0,"formal_verification":"none","one_line_summary":"A synthesis of quantum methods in finance finds that carefully designed hybrid systems offer the strongest practical advantages in optimization, pricing, risk, ML, and cryptography.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.02203","ref_index":23,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"QuantumXCT: Learning Interaction-Induced State Transformation in Cell-Cell Communication via Quantum Entanglement and Generative Modeling","primary_cat":"cs.ET","submitted_at":"2026-04-02T15:57:12+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"QuantumXCT learns parameterized quantum circuits to model interaction-induced unitary transformations between non-interacting and interacting cellular state distributions from transcriptomic profiles.","context_count":1,"top_context_role":"method","top_context_polarity":"use_method","context_text":"Mathematical Programming45(1), 503-528 (1989) https://doi.org/ 28 10.1007/BF01589116 [22] Javadi-Abhari, A., Treinish, M., Krsulich, K., Wood, C.J., Lishman, J., Gacon, J., Martiel, S., Nation, P.D., Bishop, L.S., Cross, A.W., Johnson, B.R., Gambetta, J.M.: Quantum computing with Qiskit (2024). https://doi.org/10.48550/arXiv. 2405.08810 . https://arxiv.org/abs/2405.08810 [23] Qiskit contributors: Qiskit: An Open-source Framework for Quantum Computing. https://doi.org/10.5281/zenodo.2573505 [24] Qiskit Aer contributors: Qiskit Aer: A High-performance Simulator Framework for Quantum Computing. https://doi.org/10.5281/zenodo.6342555 [25] Virtanen, P., Gommers, R., Oliphant, T.E., Haberland, M., Reddy, T., Courna- peau, D."},{"citing_arxiv_id":"2509.02272","ref_index":105,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Quantum simulations of Green's functions for small superfluid systems","primary_cat":"nucl-th","submitted_at":"2025-09-02T12:48:21+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A hybrid quantum-classical method computes accurate Green's functions for the pairing model across the normal-to-superfluid transition by combining variational ground-state preparation with quantum subspace expansion for neighboring particle numbers.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2412.01446","ref_index":50,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Magic State Injection on IBM Quantum Processors Above the Distillation Threshold","primary_cat":"quant-ph","submitted_at":"2024-12-02T12:35:52+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Experimental demonstration of logical |H_L> and |T_L> magic states with fidelities 0.8806 and 0.8665 on IBM superconducting hardware using a qubit-efficient surface code embedding, with reported error thresholds above prior values.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2311.14347","ref_index":16,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Typed compositional quantum computation with lenses","primary_cat":"cs.PL","submitted_at":"2023-11-24T08:48:00+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Coq framework with discrete lenses for typed, compositional definition and verification of quantum circuits.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2301.09241","ref_index":58,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Quantum Monte Carlo algorithm for option pricing and its complexity analysis","primary_cat":"quant-ph","submitted_at":"2023-01-23T01:55:01+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A quantum Monte Carlo algorithm solves multidimensional Black-Scholes PDEs for option pricing with polynomial complexity in dimension d and accuracy 1/ε, with rigorous error bounds and a claimed speedup over classical Monte Carlo for bounded payoffs.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}