{"total":19,"items":[{"citing_arxiv_id":"2606.27411","ref_index":100,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Compression-Driven Anomaly Detection in Brain MRI Using an Interpretable Quantum Autoencoder","primary_cat":"quant-ph","submitted_at":"2026-06-25T12:56:20+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"A variational quantum autoencoder detects anomalies in brain MRI by scoring resistance to compression, reporting slice-level ROC-AUC of 0.95 and outperforming classical autoencoders and PCA on public datasets.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.20975","ref_index":39,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Solving Einstein Field Equations on a Digital Quantum Computer","primary_cat":"gr-qc","submitted_at":"2026-06-18T22:44:08+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"A quantum algorithm for evolving Schwarzschild spacetime in the WEBB NR formalism is implemented in Qiskit and tested on simulators and IBM quantum computers.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.15464","ref_index":19,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Certified Finite-Shot Operating Windows for Virtual Distillation and Symmetry Verification","primary_cat":"quant-ph","submitted_at":"2026-06-13T20:42:40+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Proves finite-shot mean-squared-error laws for virtual distillation and symmetry verification that define certified operating windows and a selection trichotomy for their comparison.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.25132","ref_index":40,"ref_count":4,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Resource Management in Heterogeneous Quantum Repeater Networks","primary_cat":"quant-ph","submitted_at":"2026-05-24T15:22:34+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Proposes a heterogeneous quantum repeater network architecture using recursive designs and RuleSets with a new bridging building block, but states that full-scale resource trade-off analysis remains future work.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.21286","ref_index":20,"ref_count":2,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Software Between Quantum and Machine Learning -- And Down to Pulses","primary_cat":"quant-ph","submitted_at":"2026-05-20T15:20:07+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":"2605.16509","ref_index":35,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Quokka#: Quantum Computing with #SAT","primary_cat":"quant-ph","submitted_at":"2026-05-15T18:05:47+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Quokka# is a Python library that converts quantum circuit analysis tasks into #SAT problems, offering multiple encodings, approximate equivalence checking, and depth-optimal synthesis.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.13929","ref_index":38,"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.11375","ref_index":36,"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":"Transpilers, including the current state-of- the-art from IBM Qiskit [33], apply a fixed pass sequence uniformly to every circuit. This one-size-fits-all approach ignores that dif- ferent circuits have different structures and benefit from different passes, that different backends have distinct topologies and error profiles [57], and that noise on a single device drifts over time [36]. A pass that improves fidelity for one circuit may degrade another. Equally, an ill-chosen sequence can spend significant compilation time on classical HPC resources, while providing no fidelity benefit, or even reducing output quality. The optimal pass selection varies across circuits, backends, and noise conditions simultaneously. Research gap.Prior work in quantum compilation has developed"},{"citing_arxiv_id":"2605.09226","ref_index":13,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Quantum Injection Pathways for Implicit Graph Neural Networks","primary_cat":"quant-ph","submitted_at":"2026-05-09T23:51:46+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Independent quantum signal injection into graph DEQs yields higher test accuracy and fewer solver iterations than state-dependent or backbone-dependent injection and classical equilibrium models on NCI1, PROTEINS, and MUTAG benchmarks.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"into a quantum state by a data-dependent unitary, processed by a parametrized quantum circuit (PQC), and read out through measurements of chosen observables [11], [12]. Applied to graph-structured data, this template has been instantiated as quantum graph kernels, quantum graph neural networks, hy- brid graph classifiers, and graph-generation pipelines [13]- [16]. Recent work has also used graph neural networks to an- alyze parameterized quantum circuits themselves [17]. These models, however, remainexplicit finite-depth architectures. This matters because depth is a central design constraint for PQC-based models, and one that equilibrium methods are well-positioned to relieve. Deeper circuits are more expressive"},{"citing_arxiv_id":"2605.07295","ref_index":20,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"A Distributed Switching Protocol for Quantum Networks","primary_cat":"quant-ph","submitted_at":"2026-05-08T06:04:28+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"A distributed switching protocol for unbuffered quantum networks uses cooperative BSA selection and bi-path reservations to achieve high link success rates under load in simulations.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"network with an arbitrary topology is shown in Fig. 1. At the edge of the network, quantum nodes with stationary memory can be deployed, whereas the interconnection network relies arXiv:2605.07295v1 [quant-ph] 8 May 2026 on support nodes such as Bell state analyzers (or entangle- ment photon pair sources) for entanglement generation or interference [20]. This region is referred to as a Photonic Synchronization Domain (PSD) [21], where shared resources are configured to synchronize the arrival (or emission) of entangled photons so that the photons interfere, resulting in entanglement distribution between the end nodes. Q-Comp(A2) Q-Comp(C1) Q-Comp(C2) Q-Comp(B2) Q-Comp(B1) Q-Comp(A1) Photonic SynchronizationDomain"},{"citing_arxiv_id":"2604.18276","ref_index":37,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Block-encodings as programming abstractions: The Eclipse Qrisp BlockEncoding Interface","primary_cat":"quant-ph","submitted_at":"2026-04-20T13:51:06+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"The Eclipse Qrisp BlockEncoding interface provides high-level programming abstractions for block-encodings, enabling easier implementation of quantum algorithms such as QSVT, matrix inversion, and Hamiltonian simulation.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"FABLE [31] and its spiritual successors, S-FABLE and LS- FABLE [32]. One could also implement FOCQS-LCU [33] [34]. For sparse and structured matrices, one could imple- ment dictionary-based encodings [35], stabilizer-formalism- based block-encodings for Pauli strings [36], and explicit block-encodings for discrete Laplacians with mixed boundary conditions [37]. B. Quantum Numerical Linear Algebra and Matrix Equations Another path for extending theBlockEncodingclass is the one to solve complex linear matrix equations. One could implement solvers for the Sylvester equation (AX+XB=C) [38] by utilizing vectorization techniques described in [23]. This direction can also include: •Quantum Oracle Sketchingfor processing massive"},{"citing_arxiv_id":"2511.12777","ref_index":60,"ref_count":2,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Sdim: A Qudit Stabilizer Simulator","primary_cat":"quant-ph","submitted_at":"2025-11-16T21:03:52+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"Sdim is the first open-source qudit stabilizer simulator supporting all dimensions, enabling circuit evaluation and sampling for qudit fault-tolerant quantum computing research.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2511.01736","ref_index":13,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra","primary_cat":"cs.PL","submitted_at":"2025-11-03T16:48:13+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Cobble is a domain-specific language for quantum block encodings that compiles high-level matrix expressions to optimized circuits using analyses and quantum singular value transformation, achieving 2.6x-25.4x speedups over unoptimized baselines on benchmarks.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2508.00768","ref_index":31,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Evaluating Angle and Amplitude Encoding Strategies for Variational Quantum Machine Learning: their impact on model's accuracy","primary_cat":"cs.LG","submitted_at":"2025-08-01T16:43:45+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":3.0,"formal_verification":"none","one_line_summary":"Empirical comparison of angle and amplitude encoding in VQCs on Wine and Diabetes datasets shows rotational gate selection in the encoding layer changes accuracy by 10-41 percent and treats embedding as a tunable hyperparameter.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2411.09121","ref_index":18,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)","primary_cat":"cs.LO","submitted_at":"2024-11-14T01:42:03+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"AutoQ 2.0 verifies quantum programs with classical control flow and successfully checks RUS algorithms instantly plus weak-measurement Grover search on 100 qubits in about 20 minutes.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2409.00433","ref_index":46,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization","primary_cat":"quant-ph","submitted_at":"2024-08-31T12:10:32+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2408.14828","ref_index":72,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code","primary_cat":"quant-ph","submitted_at":"2024-08-27T07:25:36+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Constructions for universal quantum computation in the [[n,n-2,2]] error-detecting code detect single-gate errors at computation end, providing weak fault tolerance with reduced overhead versus full error correction.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2405.18066","ref_index":17,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"An on-demand resource allocation algorithm for a quantum network hub and its performance analysis","primary_cat":"quant-ph","submitted_at":"2024-05-28T11:25:32+00:00","verdict":"ACCEPT","verdict_confidence":"MODERATE","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Models EGS as Erlang loss system, derives blocking probability formulas for three scenarios, proves insensitivity theorem depending only on mean attempt and calibration durations.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2306.03748","ref_index":36,"ref_count":2,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Architecture and protocols for all-photonic quantum repeaters","primary_cat":"quant-ph","submitted_at":"2023-06-06T15:08:50+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"New building block and protocol for all-photonic quantum repeaters using repeater graph states that reduces emissive memories at end nodes and integrates with memory-based systems.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}