Quantum 9, 1907 (2025). https://doi.org/10.22331/q-2025-11-06-1907 We give a pair of algorithms that efficiently learn a quantum state prepared by Clifford gates and $O(log n)$ non-Clifford gates. Specifically, for an $n$-qubit state $|psirangle$ prepared with at […]
Quantum 9, 1906 (2025). https://doi.org/10.22331/q-2025-11-06-1906 We present Noise-Directed Adaptive Remapping (NDAR), a heuristic algorithm for approximately solving binary optimization problems by leveraging certain types of noise. We consider access to a noisy quantum processor with […]
Quantum 9, 1905 (2025). https://doi.org/10.22331/q-2025-11-06-1905 Quantum error-correcting codes, such as subspace, subsystem, and Floquet codes, are typically constructed within the stabilizer formalism, which does not fully capture the idea of fault tolerance needed for practical […]
Quantum 9, 1904 (2025). https://doi.org/10.22331/q-2025-11-06-1904 Relaxing the postulates of an axiomatic theory is a natural way to find more general theories, and historically, the discovery of non-Euclidean geometry is a famous example of this procedure. […]
Quantum 9, 1903 (2025). https://doi.org/10.22331/q-2025-11-06-1903 The Quantum Approximate Optimisation Algorithm (QAOA) is a widely studied quantum-classical iterative heuristic for combinatorial optimisation. While QAOA targets problems in complexity class NP, the classical optimisation procedure required in […]
Quantum 9, 1902 (2025). https://doi.org/10.22331/q-2025-10-31-1902 Quantum entanglement is a fundamental feature of quantum mechanics, yet certain entangled states that are unsteerable can be classically simulated in steering scenarios, making them unable to exhibit quantum steering. […]
Quantum 9, 1901 (2025). https://doi.org/10.22331/q-2025-10-31-1901 Several quantum and classical Monte Carlo algorithms for Betti Number Estimation (BNE) on clique complexes have recently been proposed, though it is unclear how their performances compare. We review these […]
Quantum 9, 1900 (2025). https://doi.org/10.22331/q-2025-10-31-1900 We introduce the fermionic satisfiability problem, Fermionic $k$-SAT: this is the problem of deciding whether there is a fermionic state in the null-space of a collection of fermionic, parity-conserving, projectors […]
Quantum 9, 1899 (2025). https://doi.org/10.22331/q-2025-10-29-1899 We investigate multi-mode GKP (Gottesman–Kitaev–Preskill) quantum error-correcting codes from a geometric perspective. First, we construct their moduli space as a quotient of groups and exhibit it as a fiber bundle […]
Quantum 9, 1898 (2025). https://doi.org/10.22331/q-2025-10-29-1898 We present Learning-Driven Annealing (LDA), a framework that links individual quantum annealing evolutions into a global solution strategy to mitigate hardware constraints such as short annealing times and integrated control […]
Recent Comments