相关论文: Stabilizer Tensor Networks: universal quantum simu…
Non-stabilizerness, alongside entanglement, is a crucial ingredient for fault-tolerant quantum computation and achieving a genuine quantum advantage. Despite recent progress, a complete understanding of the generation and thermalization of…
The most well-known tool for studying contextuality in quantum computation is the n-qubit stabilizer state tableau representation. We provide an extension that describes not only the quantum state, but is also outcome deterministic. The…
We consider the explicit construction of resource states for measurement-based quantum information processing. We concentrate on special-purpose resource states that are capable to perform a certain operation or task, where we consider…
We show how to efficiently simulate a quantum many-body system with tree structure when its entanglement is bounded for any bipartite split along an edge of the tree. This is achieved by expanding the {\em time-evolving block decimation}…
It is important for performance studies in quantum technologies to analyze quantum circuits in the presence of noise. We introduce an error probability tensor, a tool to track generalized Pauli error statistics of qudits within quantum…
We propose a general tensor network method for simulating quantum circuits. The method is massively more efficient in computing a large number of correlated bitstring amplitudes and probabilities than existing methods. As an application, we…
This note shows how quantum entanglement may be simulated in classical computing. The simulated entanglement protocol is implemented using oblivious transfer in the simplest case and other many-to-one mappings in more general cases. For the…
Classical simulation of quantum physics is a central approach to investigating physical phenomena. Quantum computers enhance computational capabilities beyond those of classical resources, but it remains unclear to what extent existing…
Simulation of stabilizer circuits is a well-studied problem in quantum information processing, with a number of highly optimized algorithms available. Yet, we argue that further improvements can arise from the theoretical structure of…
Entanglement-based quantum networks exhibit a unique flexibility in the choice of entangled resource states that are then locally manipulated by the nodes to fulfill any request in the network. Furthermore, this manipulation is not uniquely…
We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits…
The stabiliser formalism allows the efficient description of a sizeable class of pure as well as mixed quantum states of N-qubit systems. That same formalism has important applications in the field of quantum error correcting codes, where…
Tensor-Network (TN) states are efficient parametric representations of ground states of local quantum Hamiltonians extensively used in numerical simulations. Here we encode a TN ansatz state directly into a quantum simulator, which can…
Quantum simulation is at the heart of the ongoing "second" quantum revolution, with various synthetic quantum matter platforms realizing evermore exotic condensed matter and particle physics phenomena at high levels of precision and…
The concept of generalized concatenated quantum codes (GCQC) provides a systematic way for constructing good quantum codes from short component codes. We introduce a stabilizer formalism for GCQCs, which is achieved by defining quantum…
Hamiltonian simulation on quantum computers is strongly constrained by gate counts, motivating techniques to reduce circuit depths. While tensor networks are natural competitors to quantum computers, we instead leverage them to support…
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from…
We introduce the concept of concatenated tensor networks to efficiently describe quantum states. We show that the corresponding concatenated tensor network states can efficiently describe time evolution and possess arbitrary block-wise…
The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates,…
We relate a large class of classical spin models, including the inhomogeneous Ising, Potts, and clock models of q-state spins on arbitrary graphs, to problems in quantum physics. More precisely, we show how to express partition functions as…