量子物理

Fusion-based quantum computing is an attractive model for fault-tolerant computation based on photonics requiring only finite-sized entangled resource states followed by linear-optics operations and photon measurements. Large-scale…

Simulating correlated materials on present-day quantum hardware remains challenging due to limited quantum resources. Quantum embedding methods offer a promising route by reducing computational complexity through the mapping of bulk systems…

Simulating Clifford and near-Clifford circuits using the extended stabilizer formalism has become increasingly popular, particularly in quantum error correction. Compared to the state-vector approach, the extended stabilizer formalism can…

Neutral atom arrays provide a versatile platform to implement coherent quantum annealing as an approach to solving hard combinatorial optimization problems. Here we present and experimentally demonstrate an efficient encoding scheme based…

Observing superdiffusive scaling in the spin transport of the integrable 1D Heisenberg model is one of the key discoveries in non-equilibrium quantum many-body physics. Despite this remarkable theoretical development and the subsequent…

The process tensor provides a general representation of a quantum system evolving under repeated interventions and is fundamental for numerical simulations of local many-body dynamics. In this work, we introduce the projected process…

Decision diagrams (DDs) have emerged as an efficient tool for simulating quantum circuits due to their capacity to exploit data redundancies in quantum states and quantum operations, enabling the efficient computation of probability…

The renowned Local Friendliness no-go theorem demonstrates the incompatibility of quantum theory with the combined assumptions of Absoluteness of Observed Events - the idea that observed outcomes are singular and objective - and Local…

Tensor network formalisms have emerged as powerful tools for simulating quantum state evolution. While widely applied in the study of optical quantum circuits, such as Boson Sampling, existing tensor network approaches fail to address the…

Classifying phase transitions is a fundamental and complex challenge in condensed matter physics. This work proposes a framework for identifying quantum phase transitions by combining classical shadows with unsupervised machine learning. We…

We show that if a graph has minimum vertex degree at least d and girth at least g, where (d, g) is (3, 6) or (4, 4), then the incidence system of the graph has a (possibly infinite-dimensional) quantum solution over $\mathbb{Z}_p$ for every…

We consider the depolarizing channel in $d$ dimension defined as $D_x(\rho)=(1-x)\rho+x\: \textit{tr}({\rho}) \frac{I}{d}$, and explicitly find a quantum channel ${\cal N}_x$ which anti-degrades this, when $x\geq\frac{1}{2}$. This proves…

Entanglement serves as a foundational pillar in quantum information theory, delineating the boundary between what is classical and what is quantum. The common assumption is that higher entanglement corresponds to a greater degree of…

This work presents a tensor-network formulation of the Traveling Salesman Problem (TSP) and several of its variants. The approach represents candidate tours with tensor-network layers, weights them by Boltzmann factors, and enforces…

Encoding hard-constrained optimization problems into a variational quantum algorithm often turns out to be a challenging task. In this work, we provide a solution for the class of open-shop scheduling problems (OSSPs), which we achieve by…

We present a new mechanism for long-range entanglement (LRE) in strongly symmetric many-body mixed states that does not rely on symmetry anomalies or long-range correlations. Our primary example is the maximally mixed state in the…

The performance of quantum resource manipulation protocols, including key examples such as distillation of quantum entanglement, is measured in terms of the rate at which desired target states can be produced from a given noisy state.…

We show that the low-energy states of non-Abelian topological orders possess extensive magic which is long-ranged, and cannot be eliminated by a constant-depth local unitary circuit. This refines conventional notions of complexity beyond…

Independent and identically distributed (i.i.d.) states are ubiquitous in quantum information theory. However, in a practical setting, the i.i.d. assumption is too stringent, and possibly not realistic. A physically more compelling class of…

Characterizing large quantum systems with minimal assumptions is a central challenge in quantum information science. Self-testing provides the strongest form of certification by identifying the underlying quantum state solely from observed…