Quantum 10, 1997 (2026). https://doi.org/10.22331/q-2026-02-06-1997 We describe an efficient, fully fault-tolerant implementation of Measurement-Based Quantum Computation (MBQC) in the 3D cluster state. The two key novelties are (i) the introduction of a lattice defect in […]
Quantum 10, 1996 (2026). https://doi.org/10.22331/q-2026-02-06-1996 This work shows that minimizing the depth of a quantum circuit composed of commuting operations reduces to a vertex coloring problem on an appropriately constructed graph, where gates correspond to […]
Quantum 10, 1995 (2026). https://doi.org/10.22331/q-2026-02-03-1995 Characterizing entanglement of systems composed of multiple particles is a very complex problem that is attracting increasing attention across different disciplines related to quantum physics. The task becomes even more […]
Quantum 10, 1994 (2026). https://doi.org/10.22331/q-2026-02-03-1994 Unsupervised representation learning presents new opportunities for advancing Quantum Architecture Search (QAS) on Noisy Intermediate-Scale Quantum (NISQ) devices. QAS is designed to optimize quantum circuits for Variational Quantum Algorithms (VQAs). […]
Quantum 10, 1993 (2026). https://doi.org/10.22331/q-2026-02-02-1993 We consider the estimation of parameters encoded in the measurement record of a continuously monitored quantum system in the jump unraveling, corresponding to a single-shot scenario, where information is continuously […]
Quantum 10, 1992 (2026). https://doi.org/10.22331/q-2026-01-30-1992 Quantum computation and quantum simulation require a versatile gate set to optimize circuit compilation for practical applications. However, existing platforms are often limited to specific gate types or rely on […]
Quantum 10, 1991 (2026). https://doi.org/10.22331/q-2026-01-29-1991 QMetro++ is a Python package that provides a set of tools for identifying optimal estimation protocols that maximize quantum Fisher information (QFI). Optimization can be performed for arbitrary configurations of […]
Quantum 10, 1990 (2026). https://doi.org/10.22331/q-2026-01-28-1990 We propose an efficient protocol to realize multi-qubit gates in arrays of neutral atoms. The atoms encode qubits in the long-lived hyperfine sublevels of the ground electronic state. To realize […]
Quantum 10, 1989 (2026). https://doi.org/10.22331/q-2026-01-28-1989 Mančinska and Roberson [FOCS’20] showed that two graphs are quantum isomorphic if and only if they admit the same number of homomorphisms from any planar graph. Atserias et al. [JCTB’19] […]
Quantum 10, 1988 (2026). https://doi.org/10.22331/q-2026-01-28-1988 Quantum memories are a crucial precondition in many protocols for processing quantum information. A fundamental problem that illustrates this statement is given by the task of channel discrimination, in which […]
Recent Comments