相关论文: Clifford Circuits Augmented Grassmann Matrix Produ…

We extend the recently introduced Clifford dressed Time-Dependent Variational Principle (TDVP) to efficiently compute many-body wavefunction amplitudes in the computational basis. This advancement enhances the study of Loschmidt echoes,…

The recently proposed Clifford augmented density matrix renormalization group (CA-DMRG) method seamlessly integrates Clifford circuits with matrix product states, and takes advantage of the expression power from both. CA-DMRG has been shown…

Simulating quantum circuits classically is an important area of research in quantum information, with applications in computational complexity and validation of quantum devices. One of the state-of-the-art simulators, that of Bravyi et al,…

We describe a method to use measurements and correction operations in order to implement the Clifford group in a stabilizer code, generalising a result from [Bombin,2011] for topological subsystem colour codes. In subsystem stabilizer codes…

Quantum simulation of fermionic Hamiltonians is a leading application of quantum computing, but accurate execution on present-day hardware is limited by error accumulation in deep Trotter circuits. We present a device-matched…

Clifford circuits -- i.e. circuits composed of only CNOT, Hadamard, and $\pi/4$ phase gates -- play a central role in the study of quantum computation. However, their computational power is limited: a well-known result of Gottesman and…

We present a tree-tensor-network-based method to study strongly correlated systems with nonlocal interactions in higher dimensions. Although the momentum-space and quantum-chemistry versions of the density matrix renormalization group…

Clifford circuits are insufficient for universal quantum computation or creating $t$-designs with $t\ge 4$. While the entanglement entropy is not a telltale of this insufficiency, the entanglement spectrum is: the entanglement levels are…

The stabiliser formalism plays a central role in quantum computing, error correction, and fault tolerance. Conversions between and verifications of different specifications of stabiliser states and Clifford gates are important components of…

Is there more to Dirac's gamma matrices than meets the eye? It turns out that gamma zero can be factorized into a product of three operators. This revelation facilitates the expansion of Dirac's space-time algebra to Clifford algebra…

We propose a systematic and efficient quantum circuit composed solely of Clifford gates for simulating the ground state of the surface code model. This approach yields the ground state of the toric code in $\lceil…

Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure…

We propose a scheme for the fault-tolerant implementation of arbitrary Clifford circuits. To achieve this, we extend previous work on flag gadgets for syndrome extraction to a general framework that flags any Clifford circuit. This…

Classical simulation of quantum circuits is a critical tool for validating quantum hardware and probing the boundary between classical and quantum computational power. Existing state-of-the-art methods, notably tensor network approaches,…

We optimize matrix-product state-based algorithms for simulating quantum circuits with finite fidelity, specifically the time-evolving block decimation (TEBD) and the density-matrix renormalization group (DMRG) algorithms, by exploiting the…

Though Cliffords and matchgates are both examples of classically simulable circuits, they are considered simulable for different reasons. The celebrated Gottesman-Knill explains the simulability Cliffords, and the efficient simulability of…

As quantum devices scale up, many-body quantum gates and algorithms begin to surpass what is possible to simulate classically. Validation methods which rely on such classical simulation, such as process tomography and randomized…

We construct fixed point lattice models for group supercohomology symmetry protected topological (SPT) phases of fermions in 2+1D. A key feature of our approach is to construct finite depth circuits of local unitaries that explicitly build…

We give a novel procedure for approximating general single-qubit unitaries from a finite universal gate set by reducing the problem to a novel magnitude approximation problem, achieving an immediate improvement in sequence length by a…

The study of topological band insulators has revealed fascinating phases characterized by band topology indices and anomalous boundary modes protected by global symmetries. In strongly correlated systems, where the traditional notion of…