Quantum 10, 2189 (2026). https://doi.org/10.22331/q-2026-08-13-2189 Graph states are central resources for quantum information processing, supporting applications in computation, communication, and error correction. In photonic systems, they are typically assembled from smaller entangled states using probabilistic […]
Quantum 10, 2189 (2026). https://doi.org/10.22331/q-2026-08-13-2189 Graph states are central resources for quantum information processing, supporting applications in computation, communication, and error correction. In photonic systems, they are typically assembled from smaller entangled states using probabilistic […]
Quantum 10, 2188 (2026). https://doi.org/10.22331/q-2026-08-12-2188 Recent work by Bravyi, Gosset, and Koenig showed that there exists a search problem that a constant-depth quantum circuit can solve, but that any constant-depth classical circuit with bounded fan-in […]
Quantum 10, 2187 (2026). https://doi.org/10.22331/q-2026-08-10-2187 Hamiltonian simulation is one of the most promising candidates for the demonstration of quantum advantage within the next ten years, and several studies have proposed end-to-end resource estimates for executing […]
Quantum 10, 2186 (2026). https://doi.org/10.22331/q-2026-08-07-2186 Non-Hermitian dynamics is ubiquitous in various physical systems. While recent study shows that such a dynamics leads to an area-law scaling of the entanglement entropy due to the non-Hermitian skin […]
Quantum 10, 2185 (2026). https://doi.org/10.22331/q-2026-08-07-2185 We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut problem. Our main focus is on compilation […]
Quantum 10, 2184 (2026). https://doi.org/10.22331/q-2026-08-07-2184 The scaling of entanglement with subsystem size encodes key information about phases and criticality, but the von Neumann entropy is costly to access in experiments and simulations, often requiring full […]
Quantum 10, 2183 (2026). https://doi.org/10.22331/q-2026-08-03-2183 We consider a free fermionic chain with monitoring of the particle density on a single site of the chain and study the entanglement dynamics of quantum jump trajectories. We show […]
Quantum 10, 2182 (2026). https://doi.org/10.22331/q-2026-08-03-2182 The simulation of large-scale classical systems in exponentially small space on quantum computers has gained attention. The prior work demonstrated that a quantum algorithm offers an exponential speedup over any […]
Quantum 10, 2181 (2026). https://doi.org/10.22331/q-2026-07-31-2181 We construct several families of entanglement-assisted quasi-cyclic quantum LDPC (EA-QC-QLDPC) codes via structured tilings of permutation matrices. The entanglement-unassisted portion of the joint Tanner graph of the proposed EA-QC-QLDPC code […]
Recent Comments