Related papers: Non-stabilizerness and entanglement from cat-state…
In a quantum computation with pure states, the generation of large amounts of entanglement is known to be necessary for a speedup with respect to classical computations. However, examples of quantum computations with mixed states are known,…
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…
Quantum superpositions of macroscopically distinct classical states, so-called Schr\"{o}dinger cat states, are a resource for quantum metrology, quantum communication, and quantum computation. In particular, the superpositions of two…
The most scalable proposed methods of simulating lattice fermions on noisy quantum computers employ encodings that eliminate nonlocal operators using a constant factor more qubits and a nontrivial stabilizer group. In this work, we…
Trapped ions offer long coherence times and high fidelity, programmable quantum operations, making them a promising platform for quantum simulation of condensed matter systems, quantum dynamics, and problems related to high-energy physics.…
Fault tolerant quantum computing relies on the ability to detect and correct errors, which in quantum error correction codes is typically achieved by projectively measuring multi-qubit parity operators and by conditioning operations on the…
Cat states, which were initially proposed to manifest macroscopic superpositions, play an outstanding role in fundamental aspects of quantum dynamics. In addition, they have potential applications in quantum computation and quantum sensing.…
The interplay between non-stabilizerness and entanglement in random states is a very rich arena of study for the understanding of quantum advantage and complexity. In this work, we tackle the problem of such interplay in random pure quantum…
Notions of circuit complexity and cost play a key role in quantum computing and simulation where they capture the (weighted) minimal number of gates that is required to implement a unitary. Similar notions also become increasingly prominent…
The ubiquity of stabilizer circuits in the design and operation of quantum computers makes techniques to verify their correctness essential. The simulation of stabilizer circuits, which aims to replicate their behavior using a classical…
Classical simulation of quantum circuits plays a crucial role in validating quantum hardware and delineating the boundaries of quantum advantage. Among the most effective simulation techniques are those based on the stabilizer extent, which…
Quantum steering is observed when performing appropriate local measurements on an entangled state. Here we discuss the possibility of simulating classically this effect, using classical communication instead of entanglement. We show that…
A recently introduced classical simulation method for universal quantum computation with magic states operates by repeated sampling from probability functions [M. Zurel et al. PRL 260404 (2020)]. This method is closely related to sampling…
We provide an alternative interpretation of recently published experimental results that were represented as demonstrating entanglement between two macroscopic quantum Josephson oscillators. We model the experimental system using the…
We present an algorithm for efficiently simulating a quantum circuit in the graph formalism. In the graph formalism, we represent states as a linear combination of graphs with Clifford operations on their vertices. We show how a…
The striking nonlinear effects exhibited by cavity QED systems make them a powerful tool in modern condensed matter and atomic physics. A recently discovered example is the quantized pumping of energy into a cavity by a strongly-coupled,…
Open quantum systems evolving according to discrete-time dynamics are capable, unlike continuous-time counterparts, to converge to a stable equilibrium in finite time with zero error. We consider dissipative quantum circuits consisting of…
Recent advances in quantum hardware are bringing fault-tolerant quantum computing (FTQC) closer to reality. In the early stage of FTQC, however, the numbers of available logical qubits and high-fidelity $T$ gates remain limited, making it…
We show that any pseudoentangled state ensemble with a gap of $t$ bits of entropy requires $\Omega(t)$ non-Clifford gates to prepare. This bound is tight up to polylogarithmic factors if linear-time quantum-secure pseudorandom functions…
We introduce a systematic study of "symmetric quantum circuits", a new restricted model of quantum computation that preserves the symmetries of the problems it solves. This model is well-adapted for studying the role of symmetry in quantum…