Quantum 8, 1352 (2024). https://doi.org/10.22331/q-2024-05-22-1352 The Quantum Max Cut (QMC) problem has emerged as a test-problem for designing approximation algorithms for local Hamiltonian problems. In this paper we attack this problem using the algebraic structure […]
Quantum 8, 1351 (2024). https://doi.org/10.22331/q-2024-05-21-1351 Magic, or nonstabilizerness, characterizes the deviation of a quantum state from the set of stabilizer states, playing a fundamental role in quantum state complexity and universal fault-tolerant quantum computing. However, […]
Quantum 8, 1350 (2024). https://doi.org/10.22331/q-2024-05-21-1350 We propose efficient algorithms for classically simulating fermionic linear optics operations applied to non-Gaussian initial states. By gadget constructions, this provides algorithms for fermionic linear optics with non-Gaussian operations. We […]
Quantum 8, 1349 (2024). https://doi.org/10.22331/q-2024-05-16-1349 A set of orthogonal product states is strongly nonlocal if it is locally irreducible in every bipartition, which shows the phenomenon of strong quantum nonlocality without entanglement. Although such a […]
Quantum 8, 1348 (2024). https://doi.org/10.22331/q-2024-05-14-1348 Motivated by quantum network applications over classical channels, we initiate the study of $n$-party resource states from which LOCC protocols can create EPR-pairs between any $k$ disjoint pairs of parties. […]
Quantum 8, 1347 (2024). https://doi.org/10.22331/q-2024-05-14-1347 Magic is a property of a quantum state that characterizes its deviation from a stabilizer state, serving as a useful resource for achieving universal quantum computation e.g., within schemes that […]
Quantum 8, 1346 (2024). https://doi.org/10.22331/q-2024-05-14-1346 Transitions out of the ground space limit the performance of quantum adiabatic algorithms, while hardware imperfections impose stringent limitations on the circuit depth. We propose an adiabatic echo verification protocol […]
Quantum 8, 1345 (2024). https://doi.org/10.22331/q-2024-05-14-1345 Hypergraph product codes are a promising avenue to achieving fault-tolerant quantum computation with constant overhead. When embedding these and other constant-rate qLDPC codes into 2D, a significant number of nonlocal […]
Quantum 8, 1344 (2024). https://doi.org/10.22331/q-2024-05-14-1344 We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes, and describe code surgery between such codes using a specific colimit in the category of chain complexes. […]
Quantum 8, 1343 (2024). https://doi.org/10.22331/q-2024-05-14-1343 Shortening quantum circuits is crucial to reducing the destructive effect of environmental decoherence and enabling useful algorithms. Here, we demonstrate an improvement in such compilation tasks via a combination of […]
Recent Comments