Related papers: Preparing topological states with finite depth sim…
High-order topological phases of matter refer to the systems of $n$-dimensional bulk with the topology of $m$-th order, exhibiting $(n-m)$-dimensional boundary modes and can be characterized by topological pumping. Here, we experimentally…
The idea of topological quantum computation is to build powerful and robust quantum computers with certain macroscopic quantum states of matter called topologically ordered states. These systems have degenerate ground states that can be…
We investigate two models for performing topological quantum gates with the Aharonov-Bohm (AB) and Aharonov-Casher (AC) effects. Topological one- and two-qubit Abelian phases can be enacted with the AB effect using charge qubits, whereas…
A highly coveted goal is to realize emergent non-Abelian gauge theories and their anyonic excitations, which encode decoherence-free quantum information. While measurements in quantum devices provide new hope for scalably preparing such…
Kitaev's toric code is an exactly solvable model with $\mathbb{Z}_2$-topological order, which has potential applications in quantum computation and error correction. However, a direct experimental realization remains an open challenge.…
Any quantum computational network can be constructed with a sequence of the two-qubit diagonal quantum gates and one-qubit gates in two-state quantum systems. The universal construction of these quantum gates in the quantum systems and of…
Topological orders are a class of exotic states of matter characterized by patterns of long-range entanglement. Certain topologically ordered systems are proposed as potential realization of fault-tolerant quantum computation. Topological…
The Quantum State Preparation problem aims to prepare an $n$-qubit quantum state $|\psi_v\rangle =\sum_{k=0}^{2^n-1}v_k|k\rangle$ from the initial state $|0\rangle^{\otimes n}$, for a given unit vector $v=(v_0,v_1,v_2,\ldots,v_{2^n-1})^T\in…
We have previously discussed the design of a neutral atom quantum computer with an on-demand interaction [E. Hosseini Lapasar, et al., J. Phys. Soc. Jpn. 80, 114003 (2011)]. In this contribution, we propose an experimental method to…
We propose an implementation of a two-dimensional $\mathbb{Z}_2$ lattice gauge theory model on a shallow quantum circuit, involving a number of single and two-qubits gates comparable to what can be achieved with present-day and near-future…
We present a theoretical proposal for the implementation of geometric quantum computing based on a Hamiltonian which has a doubly degenerate ground state. Thus the system which is steered adiabatically, remains in the ground-state. The…
Quantum simulations of non-Abelian gauge theories require efficient mappings onto quantum computers and practical state preparation and measurement procedures. A truncation of the Hilbert space of non-Abelian lattice gauge theories with…
Haah's cubic code is the prototypical type-II fracton topological order. It instantiates the no string-like operator property that underlies the favorable scaling of its code distance and logical energy barrier. Previously, the cubic code…
We present hybrid Gibbs sampling algorithms for the stabilizer code Hamiltonians of the rotated surface code and the toric code with only local quantum algorithms, using $\sim L/2$ quantum circuit depth to prepare the Gibbs state of the…
We present a new robust decoupling scheme suitable for levels with either half integer or integer angular momentum states. Through continuous dynamical decoupling techniques, we create a protected qubit subspace, utilizing a multi-state…
A prominent example of a topologically ordered system is Kitaev's quantum double model $\mathcal{D}(G)$ for finite groups $G$ (which in particular includes $G = \mathbb{Z}_2$, the toric code). We will look at these models from the point of…
Fermionic ansatz state preparation is a critical subroutine in many quantum algorithms such as Variational Quantum Eigensolver for quantum chemistry and condensed matter applications. The shallowest circuit depth needed to prepare Slater…
We present experimental results on the preparation of a desired quantum state in a two-level system with the maximum possible fidelity using driving protocols ranging from generalizations of the linear Landau-Zener protocol to…
The prevalent approach to executing quantum algorithms on quantum computers is to break-down the algorithms to a concatenation of universal gates, typically single and two-qubit gates. However such a decomposition results in long gate…
Quantum state preparation, also known as encoding or embedding, is a crucial initial step in many quantum algorithms and often constrains theoretical quantum speedup in fields such as quantum machine learning and linear equation solvers.…