Quantum 10, 2100 (2026). https://doi.org/10.22331/q-2026-05-12-2100 Classical machine learning has proven remarkably useful in post-processing quantum data, yet typical learning algorithms often require prior training to be effective. In this work, we employ a tensorial kernel […]
Quantum 10, 2099 (2026). https://doi.org/10.22331/q-2026-05-08-2099 Current and near-term quantum hardware is constrained by limited qubit counts, circuit depth, and the high cost of repeated measurements. We address these challenges for solid-state Hamiltonians by introducing a […]
Quantum 10, 2098 (2026). https://doi.org/10.22331/q-2026-05-06-2098 In this paper, we develop the resource theory of quantum secret key. Operating under the assumption that entangled states with zero distillable key do not exist, we define the key […]
Quantum 10, 2097 (2026). https://doi.org/10.22331/q-2026-05-06-2097 We show the 2-Local Stoquastic Hamiltonian problem on a 2D square qubit lattice is StoqMA-complete. We achieve this by extending the spatially sparse circuit construction of Oliveira and Terhal, as […]
Quantum 10, 2096 (2026). https://doi.org/10.22331/q-2026-05-06-2096 This paper aims to devise the shape of the external electromagnetic field that drives the spin dynamics of radical pairs to a quantum coherent state through maximization of the triplet-born […]
Quantum 10, 2095 (2026). https://doi.org/10.22331/q-2026-05-05-2095 State conversion is a fundamental task in quantum information processing. Quantum resource theories allow for analyzing and bounding conversions that use restricted sets of operations. In the context of continuous-variable […]
Quantum 10, 2094 (2026). https://doi.org/10.22331/q-2026-05-05-2094 Graph states are entangled states that are essential for quantum information processing. As experimental advances enable the realization of large-scale graph states, efficient fidelity estimation methods are crucial for assessing […]
Quantum 10, 2093 (2026). https://doi.org/10.22331/q-2026-05-05-2093 Quantum circuit simulation is paramount to the verification and optimization of quantum algorithms, and considerable research efforts have been made towards efficient simulators. While circuits often contain high-level gates such […]
Quantum 10, 2092 (2026). https://doi.org/10.22331/q-2026-05-05-2092 Calculating the quantum weight enumerator polynomial (WEP) is a valuable tool for characterizing quantum error-correcting (QEC) codes, but it is computationally hard for large or complex codes. The Quantum LEGO […]
Quantum 10, 2091 (2026). https://doi.org/10.22331/q-2026-05-05-2091 Quantum hypergraph states form a generalisation of the graph state formalism that goes beyond the pairwise (dyadic) interactions imposed by remaining inside the Gaussian approximation. Networks of such states are […]
Recent Comments