Quantum 10, 2176 (2026). https://doi.org/10.22331/q-2026-07-29-2176 Dynamical stabilizer codes may offer a practical route to large-scale quantum computation. Such codes are defined by a schedule of error-detecting measurements, which allows for flexibility in their construction. In […]
Quantum 10, 2175 (2026). https://doi.org/10.22331/q-2026-07-28-2175 Based on the mapping between stabilizer quantum error correcting codes and disordered statistical mechanics models, we define a ratio of partition functions that measures the success probability for maximum partition […]
Quantum 10, 2174 (2026). https://doi.org/10.22331/q-2026-07-23-2174 An ensemble of product states is said to exhibit “quantum nonlocality without entanglement” if it cannot be optimally discriminated using local operations and classical communication (LOCC). We show that this […]
Quantum 10, 2173 (2026). https://doi.org/10.22331/q-2026-07-23-2173 Quantum circuit simulators running on classical computers offer a vital platform for designing, testing, and optimizing quantum algorithms, driving innovation despite limited access to real quantum hardware. However, their scalability […]
Quantum 10, 2172 (2026). https://doi.org/10.22331/q-2026-07-23-2172 We show that Gottesman’s (1998) semantics for Clifford circuits based on the Heisenberg representation gives rise to a lightweight Hoare-like logic for efficiently characterizing a common subset of quantum programs. […]
Quantum 10, 2171 (2026). https://doi.org/10.22331/q-2026-07-22-2171 The Clifford group plays a central role in quantum information science. It is the building block for many error-correcting schemes and matches the first three moments of the Haar measure […]
Quantum 10, 2170 (2026). https://doi.org/10.22331/q-2026-07-22-2170 Quantum Error Correction (QEC) is regarded as the most promising path to quantum advantage. The success of QEC relies on achieving quantum gate fidelities below the error threshold of the […]
Quantum 10, 2169 (2026). https://doi.org/10.22331/q-2026-07-22-2169 Non-commutative polynomial optimization (NPO) problems seek to minimize the state average of a polynomial of some operator variables, subject to polynomial constraints, over all states and operators, as well as […]
Quantum 10, 2168 (2026). https://doi.org/10.22331/q-2026-07-22-2168 How many $T$ gates are needed to approximate an arbitrary $n$-qubit quantum state to within error $varepsilon$? Improving prior work of Low, Kliuchnikov, and Schaeffer, we show that the optimal […]
Quantum 10, 2167 (2026). https://doi.org/10.22331/q-2026-07-20-2167 Quantum Zeno dragging enables the preparation of common eigenstates of a set of observables by frequent measurement and adiabatic-like modulation of the measurement basis. In this work, we present a […]
Recent Comments