Tootfinder

Cheat-Penalised Quantum Weak Coin-Flipping
Atul Singh Arora, Carl A. Miller, Mauro E. S. Morales, Jamie Sikora
https://arxiv.org/abs/2510.03218 https://arx…

Cheat-Penalised Quantum Weak Coin-Flipping
Coin-flipping is a fundamental task in two-party cryptography where two remote mistrustful parties wish to generate a shared uniformly random bit. While quantum protocols promising near-perfect security exist for weak coin-flipping -- when the parties want opposing outcomes -- it has been shown that they must be inefficient in terms of their round complexity, and it is an open question of how space efficient they can be. In this work, we consider a variant called cheat-penalised weak coin-flipp…

SoK: A Systematic Review of Malware Ontologies and Taxonomies and Implications for the Quantum Era
Dehinde Molade, Dave Ormrod, Mamello Thinyane, Nalin Arachchilage, Jill Slay
https://arxiv.org/abs/2509.19650

SoK: A Systematic Review of Malware Ontologies and Taxonomies and Implications for the Quantum Era
The threat of quantum malware is real and a growing security concern that will have catastrophic scientific and technological impacts, if not addressed early. If weaponised or exploited especially by the wrong hands, malware will undermine highly sophisticated critical systems supported by next-generation quantum architectures, for example, in defence, communications, energy, and space. This paper explores the fundamental nature and implications of quantum malware to enable the future developme…

Measuring the measurement problem: controlling decoherence with measurement duration in molecular MCB junctions
C. J. Muller
https://arxiv.org/abs/2510.01945 https://

Measuring the measurement problem: controlling decoherence with measurement duration in molecular MCB junctions
We investigate the influence of the measurement duration on quantum coherence in molecular mechanically controlled break junctions operating in a tetrahydrofuran (THF) partially wet phase. These systems represent a distinct class of enclosed open quantum systems with unusually long decoherence times at ambient conditions, on the order of 1-20 ms. By tuning the integration time of the current measurement in current-voltage (IV) characteristics, relative to the decoherence time, we observe a tran…

Statistical Mechanics of Random Mixed State Ensembles with Fixed Energy
Harry J. D. Miller
https://arxiv.org/abs/2508.00809 https://arxiv.org/pdf/2508.0080…

Statistical Mechanics of Random Mixed State Ensembles with Fixed Energy
Mixed state ensembles such as the Bures-Hall and Hilbert-Schmidt measure are probability distributions that characterise the statistical properties of random density matrices and can be used to determine the typical features of mixed quantum states. Here we extend this framework by considering the properties of random states with fixed average energy, and the ensemble-averaged density matrix is derived under this additional physical constraint. This gives rise to a type of microcanonical ensemb…

Distances between pure quantum states induced by a distance matrix
Tomasz Miller, Rafa{\l} Bistro\'n
https://arxiv.org/abs/2509.14727 https://arxiv.org…

Distances between pure quantum states induced by a distance matrix
With the help of a given distance matrix of size $n$, we construct an infinite family of distances $d_p$ (where $p \geq 2$) on the the complex projective space $\mathbb{P}(\mathbb{C}^n)$, modelling the space of pure states of an $n$-dimensional quantum system. The construction can be seen as providing a natural way to isometrically embed any given finite metric space into the space of pure quantum states 'spanned' upon it. In order to show that the maps $d_p$ are indeed distance functions -- in…

Introducing CQ: A C-like API for Quantum Accelerated HPC
Oliver Thomson Brown, Mateusz Meller, James Richings
https://arxiv.org/abs/2508.10854 https://arxi…

Introducing CQ: A C-like API for Quantum Accelerated HPC
In this paper we present CQ, a specification for a C-like API for quantum accelerated HPC, as well as CQ-SimBE, a reference implementation of CQ written in C99, and built on top of the statevector simulator QuEST. CQ focuses on enabling the incremental integration of quantum computing into classical HPC codes by supporting runtime offloading from languages such as C and Fortran. It provides a way of describing and offloading quantum computations which is compatible with strictly and strongly ty…

Quantum chaos and pole skipping in two-dimensional conformal perturbation theory
Curtis T. Asplund, Sebastian Fischetti, Alexandra Miller, David M. Ramirez
https://arxiv.org/abs/2509.18540

Scaling Hybrid Quantum-HPC Applications with the Quantum Framework
Srikar Chundury, Amir Shehata, Seongmin Kim, Muralikrishnan Gopalakrishnan Meena, Chao Lu, Kalyana Gottiparthi, Eduardo Antonio Coello Perez, Frank Mueller, In-Saeng Suh
https://arxiv.org/abs/2509.14470

Scaling Hybrid Quantum-HPC Applications with the Quantum Framework
Hybrid quantum-high performance computing (Q-HPC) workflows are emerging as a key strategy for running quantum applications at scale in current noisy intermediate-scale quantum (NISQ) devices. These workflows must operate seamlessly across diverse simulators and hardware backends since no single simulator offers the best performance for every circuit type. Simulation efficiency depends strongly on circuit structure, entanglement, and depth, making a flexible and backend-agnostic execution model…

Universal Quantum Error Mitigation via Random Inverse Depolarizing Approximation
Alexander X. Miller, Micheline B. Soley
https://arxiv.org/abs/2508.17513 https://

Universal Quantum Error Mitigation via Random Inverse Depolarizing Approximation
Given the severity of noise in near-term quantum computing, error mitigation is essential to reduce error in quantum-computer-generated expectation values. We introduce RIDA (Random Inverse Depolarizing Approximation), a simple universal method that harnesses randomly generated circuits to estimate a given circuit's global depolarization probability and corresponding error-free expectation value. Numerical tests indicate RIDA outperforms key benchmarks, suggestive of significant accuracy improv…

Compensating connectivity restrictions in quantum annealers via splitting and linearization techniques
Marcel Seelbach Benkner, Zorah L\"ahner, Vladislav Golyanik, Martin Kliesch, Michael Moeller
https://arxiv.org/abs/2507.12536

Compensating connectivity restrictions in quantum annealers via splitting and linearization techniques
Current quantum annealing experiments often suffer from restrictions in connectivity in the sense that only certain qubits can be coupled to each other. The most common strategy to overcome connectivity restrictions so far is by combining multiple physical qubits into a logical qubit with higher connectivity, which is achieved by adding terms to the Hamiltonian. Practically, this strategy is implemented by finding a so-called minor embedding, which is in itself an NP-hard problem. In this work,…