Related papers: Local non-CSS quantum error correcting code on a t…
We consider the CSS algorithm relating self-orthogonal classical linear codes to q-ary quantum stabilizer codes and we show that to such a pair of a classical and a quantum code one can associate geometric spaces constructed using methods…
We introduce a "second-quantized" representation of the ring of symmetric functions to further develop a purely second-quantized -- or "lattice" -- approach to the study of zero modes of frustration free Haldane-pseudo-potential-type…
It is known that fixed boundary conditions modify the leading finite-size corrections for an L^3 lattice in 3d at a first-order phase transition from 1/L^3 to 1/L. We note that an exponential low-temperature phase degeneracy of the form…
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…
In this work we show that the simple Hamiltonians used in Quantum Graphity models are highly degenerate, having multiple ground states that are not lattices. In order to assess the distance of the resulting graphs from a lattice graph, we…
We show how a quantum computer may efficiently simulate a disordered Hamiltonian, by incorporating a pseudo-random number generator directly into the time evolution circuit. This technique is applied to quantum simulation of few-body…
We propose a new physical implementation of spin qubits for quantum information processing, namely defect states in antidot lattices defined in the two-dimensional electron gas at a semiconductor heterostructure. Calculations of the band…
The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems. We also show that a quantum…
The NLTS (No Low-Energy Trivial State) conjecture of Freedman and Hastings [2014] posits that there exist families of Hamiltonians with all low energy states of high complexity (with complexity measured by the quantum circuit depth…
Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences…
Recently, it has become apparent that the thermal stability of topologically ordered systems at finite temperature, as discussed in condensed matter physics, can be studied by addressing the feasibility of self-correcting quantum memory, as…
We numerically study coherent errors in surface codes on planar graphs, focusing on noise of the form of $Z$- or $X$-rotations of individual qubits. We find that, similarly to the case of incoherent bit- and phase-flips, a trade-off between…
The investigation of the behavior of both classical and quantum systems on non-Euclidean surfaces near the phase transition point represents an interesting research area of modern physics. In the case of classical spin systems, a…
Deriving quantum error correction and quantum control from the Schrodinger equation for a unified qubit-environment Hamiltonian will give insights into how microscopic degrees of freedom affect the capability to control and correct quantum…
Stabilizer operations are at the heart of quantum error correction and are typically implemented in software-controlled entangling gates and measurements of groups of qubits. Alternatively, qubits can be designed so that the Hamiltonian…
Collective coherent (CC) errors are inevitable, as every physical qubit undergoes free evolution under its kinetic Hamiltonian. These errors can be more damaging than stochastic Pauli errors because they affect all qubits coherently,…
A large class of quantum phase transitions for quantum lattice systems are characterized by local order parameters. It is shown that local order parameters may be systematically constructed from tensor network representations of quantum…
The toric code can be constructed as a gauge theory of finite groups on oriented two dimensional lattices. Here we construct analogous models with the gauge fields belonging to groupoids, which are categories where every morphism has an…
We propose a simplified version of the Kitaev's surface code in which error correction requires only three-qubit parity measurements for Pauli operators XXX and ZZZ. The new code belongs to the class of subsystem stabilizer codes. It…
We study the resilience of the surface code to decoherence caused by the presence of a bosonic bath. This approach allows us to go beyond the standard stochastic error model commonly used to quantify decoherence and error threshold…