Compare Papers

Paper 1

Absolute Coherence - Resonance over Resistance — a Conceptual Framework for Quantum Technologies

Hakan Henken

Year: 2026
Journal: Zenodo (CERN European Organization for Nuclear Research)
DOI: 10.5281/zenodo.18843028
arXiv: -

This essay proposes 'Absolute Coherence' as a design principle that treatsdecoherence not as loss, but as a context-dependent modulation of an ever-presentcoherent ground state. In contrast to conventional quantum error correction, thisapproach motivates passive, integrative strategies that treat coherence as the defaultcondition. Drawing on a concrete technical proposal (phononic bandgaps combinedwith decoherence-free subspaces in NV-center ensembles), it is argued that thisperspective may address key scaling bottlenecks in quantum computing — inparticular the reliance on millikelvin cooling and active error correction. The essayclearly distinguishes analogy from isomorphism and invites interdisciplinarydiscussion.

Open paper

Paper 2

Optimizing and benchmarking the computation of the permanent of general matrices

Cassandra Masschelein, Michelle Richer, Paul W. Ayers

Year: 2025
Journal: arXiv preprint
DOI: arXiv:2510.03421
arXiv: 2510.03421

Evaluating the permanent of a matrix is a fundamental computation that emerges in many domains, including traditional fields like computational complexity theory, graph theory, many-body quantum theory and emerging disciplines like machine learning and quantum computing. While conceptually simple, evaluating the permanent is extremely challenging: no polynomial-time algorithm is available (unless $\textsc{P} = \textsc{NP}$). To the best of our knowledge there is no publicly available software that automatically uses the most efficient algorithm for computing the permanent. In this work we designed, developed, and investigated the performance of our software package which evaluates the permanent of an arbitrary rectangular matrix, supporting three algorithms generally regarded as the fastest while giving the exact solution (the straightforward combinatoric algorithm, the Ryser algorithm, and the Glynn algorithm) and, optionally, automatically switching to the optimal algorithm based on the type and dimensionality of the input matrix. To do this, we developed an extension of the Glynn algorithm to rectangular matrices. Our free and open-source software package is distributed via Github, at https://github.com/theochem/matrix-permanent.

Open paper