相关论文: Single T gate in a Clifford circuit drives transit…
The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We prove that a quantum circuit with $T$ gates whose underlying graph has treewidth $d$ can be simulated deterministically in…
In order for quantum computations to be done as efficiently as possible it is important to optimise the number of gates used in the underlying quantum circuits. In this paper we find that many gate optimisation problems for approximately…
"Forgetful" measurements-physically similar to dephasing-are of interest both for applications to fault-tolerant quantum computing and fundamentally, in studying how entanglement and entropy spread. This paper investigates…
Entanglement properties of bipartite unitary operators are studied via their local invariants, namely the entangling power $e_p$ and a complementary quantity, the gate typicality $g_t$. We characterize the boundaries of the set $K_2$…
We study numerically the evolution of energy-level statistics as an integrability-breaking term is added to the XXZ Hamiltonian. For finite-length chains, physical properties exhibit a cross-over from behavior resulting from the Poisson…
At higher energies the present complex quantum theory with its unitary group might expand into a real quantum theory with an orthogonal group, broken by an approximate $i$ operator at lower energies. Implementing this possibility requires a…
We present a quantum algorithm to compute the entanglement spectrum of arbitrary quantum states. The interesting universal part of the entanglement spectrum is typically contained in the largest eigenvalues of the density matrix which can…
We study measurement-induced entanglement generated by column-by-column sampling of noisy 2D random Clifford circuits of size $N$ and depth $T$. Focusing on the operator entanglement $S_{\rm op}$ of the sampling-induced boundary state,…
Given a quantum error correcting code, an important task is to find encoded operations that can be implemented efficiently and fault-tolerantly. In this Letter we focus on topological stabilizer codes and encoded unitary gates that can be…
We study quantum circuits with gates composed randomly of identity operators, projectors, or a kind of $R$ matrices which satisfy the Yang-Baxter equation and are unitary and dual-unitary. This enables us to translate the quantum circuit…
The goal of benchmarking is to determine how far the output of a noisy system is from its ideal behavior; this becomes exceedingly difficult for large quantum systems where classical simulations become intractable. A common approach is to…
Previous results indicate that while chaos can lead to substantial entropy production, thereby maximizing dynamical entanglement, this still falls short of maximality. Random Matrix Theory (RMT) modeling of composite quantum systems,…
The entanglement entropy in many gapless quantum systems receives a contribution from corners in the entangling surface in 2+1d. It is characterized by a universal function $a(\theta)$ depending on the opening angle $\theta$, and contains…
Recent advances in manipulating single electron spins in quantum dots have brought us close to the realization of classical logic gates based on representing binary bits in spin polarizations of single electrons. Here, we show that a linear…
Clifford gates play a role in the optimisation of Clifford+T circuits. Reducing the count and the depth of Clifford gates, as well as the optimal scheduling of T gates, influence the hardware and the time costs of executing quantum…
We introduce a scheme to characterise a qudit T gate that has different noise than a set of Clifford gates. We developed our scheme through representation theory and ring theory to generalise non-Clifford interleaved benchmarking to qudit…
We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While single-gate universal sets are known, they rely on precisely…
Entanglement transitions in quantum dynamics present a novel class of phase transitions in non-equilibrium systems. When a many-body quantum system undergoes unitary evolution interspersed with monitored random measurements, the…
We investigate the dynamics of two-dimensional quantum spin systems under the combined effect of random unitary gates and local projective measurements. When considering steady states, a measurement-induced transition occurs between two…
Fault-tolerant quantum computation (FTQC) is essential to implement quantum algorithms in a noise-resilient way, and thus to enjoy advantages of quantum computers even with presence of noise. In FTQC, a quantum circuit is decomposed into…