Explore research
Find papers, conference contributions, and reports, then follow each item to its original source.
Start with a topic and a publication year. Newest first follows the earliest known public year of a linked work, rather than the date it was added here. Citations help trace established literature; they do not measure research quality.
How to use years and citation counts · Read our research analysis · Error-correction reading path
Use the research library to compare publication years, trace indexed citations, and follow linked versions to their sources.
Research library
Showing a recent sample from 8,788 source records.
- 2026-09-05
- 2026-09-04PreprintarXiv
Towards Scaling Quantum Fine-Tuning of Foundational Time Series Models for Classification
Citations not indexed - 2026-09-04PreprintarXiv
Parametric and feedback-controlled multiparameter quantum estimation in a double cavity optomechanics: steady and dynamical state
Citations not indexed - 2026-09-04
- 2026-09-04
- 2026-09-04PreprintarXiv
Coincidence-based spectral engineering for spectral matching in cascaded downconversion
Citations not indexed - 2026-09-04
- 2026-09-04
- 2026-09-04PreprintarXiv
Restricting the effects hides a nonphysical symmetry from every causal structure
Citations not indexed - 2026-09-04PreprintarXiv
Compiling the 2D Fermi-Hubbard ground-state energy estimation algorithm for active volume quantum architectures
Citations not indexed - 2026-09-04
- 2026-09-04
- 2026-09-04PreprintarXiv
Quantum Optimisation for Protein-Protein Interaction Network Alignment
Citations not indexed - 2026-09-04PreprintarXiv
TETRIS-Q: Tiling-based Effective Transient-fault Reduction on Interleaved Superconducting Qubits
Citations not indexed - 2026-09-04PreprintarXiv
A double-resonator coupler for high-fidelity two-qubit gates between superconducting qubits
Citations not indexed - 2026-09-04PreprintarXiv
Optimal inequalities for completely bounded polynomials and the limitations of quantum query algorithms
Citations not indexed - 2026-09-04PreprintarXiv
AxQM: A Textbook-Scale Benchmark for Formal Proof Synthesis in a Library of Finite-Dimensional Quantum Mechanics
Citations not indexed - 2026-09-04PreprintarXiv
Fanout Complexity of Symmetric Boolean Functions in $\mathsf{QAC}^0$
Citations not indexed - 2026-09-04PreprintarXiv
Environment-assisted transport in a strongly correlated boundary-driven Fermi-Hubbard chain
Citations not indexed - 2026-09-04PreprintarXiv
Non-local games and communication complexity with noisy entanglement
Citations not indexed
Read beyond the abstract
Our research notes separate reported results from interpretation, and explain what to check before comparing claims.
- Below threshold: what a surface-code memory proves
Increasing code distance can improve a logical memory while leaving important computational capabilities untested. Use the measured task, denominator, and decoder conditions to assess the claim.
- 48 logical qubits: read the acceptance conditions too
A logical-qubit count becomes informative when paired with encoding, circuit, evaluation metric, and retained trials. This note offers a worksheet for comparing demonstrations with different selection conditions.
- Better than physical: which circuit is the baseline?
An improvement factor needs its physical baseline and selection rule. Use this paper to practice comparing an encoded circuit with the actual unencoded task, rather than a headline gate fidelity.