Related papers: Preparing topological states with finite depth sim…
We propose a variational quantum algorithm to prepare ground states of 1D lattice quantum Hamiltonians specifically tailored for programmable quantum devices where interactions among qubits are mediated by Quantum Data Buses (QDB). For…
While all quantum algorithms can be expressed in terms of single-qubit and two-qubit gates, more expressive gate sets can help reduce the algorithmic depth. This is important in the presence of gate errors, especially those due to…
Non-Abelian topological order (TO) enables topologically protected quantum computation with its anyonic quasiparticles. Recently, TO with $S_3$ gauge symmetry was identified as a sweet spot -- simple enough to emerge from finite-depth…
We present improved circuits for the control-control-phase (Toffoli) gate and the control-swap (Fredkin) gate using three and four global two-qubit gates, respectively. This is a nearly double speed-up compared to the conventional circuits,…
We study theoretically a double quantum dot hydrogen molecule in the GaAs conduction band as the basic elementary gate for a quantum computer with the electron spins in the dots serving as qubits. Such a two-dot system provides the…
Parallel operations are important for both near-term quantum computers and larger-scale fault-tolerant machines because they reduce execution time and qubit idling. We propose and implement a pairwise-parallel gate scheme on a trapped-ion…
Geometric quantum computation relies on the geometric phase that arises in adiabatic cyclic evolutions of non-degenerate quantum systems, enabling the design of robust quantum gates. However, the adiabatic condition requires long evolution…
As the effort to scale up existing quantum hardware proceeds, it becomes necessary to schedule quantum gates in a way that minimizes the number of operations. There are three constraints that have to be satisfied: the order or dependency of…
Variational quantum algorithms have been advocated as promising candidates to solve combinatorial optimization problems on near-term quantum computers. Their methodology involves transforming the optimization problem into a quadratic…
We theoretically propose a quantum simulation scheme for the toric-code Hamiltonian, the paradigmatic model of a quantum spin liquid, based on time-periodic driving. We develop a hybrid continuous-digital strategy that exploits the…
We analyze surface codes, the topological quantum error-correcting codes introduced by Kitaev. In these codes, qubits are arranged in a two-dimensional array on a surface of nontrivial topology, and encoded quantum operations are associated…
In view of the fundamental importance and many promising potential applications, non-Abelian statistics of topologically protected states have attracted much attention recently. However, due to the operational difficulties in solid-state…
We show a significant reduction of the number of quantum operations and the improvement of the circuit depth for the realization of the Toffoli gate by using qudits. This is done by establishing a general relation between the dimensionality…
We propose a new protocol to implement ultra-fast two-qubit phase gates with trapped ions using spin-dependent kicks induced by resonant transitions. By only optimizing the allocation of the arrival times in a pulse train sequence the gate…
The preparation of quantum states serves as a pivotal subroutine across various domains, including quantum communication protocols, quantum computing, and the exploration of quantum correlations and other resources within physical systems.…
Circuit cutting, the partitioning of quantum circuits into smaller independent fragments, has become a promising avenue for scaling up current quantum-computing experiments. Here, we introduce a scheme for joint cutting of two-qubit…
In this work, we introduce constructions for non-Abelian qLDPC codes obtained by gauging transversal Clifford gates using measurement and feedback. In particular, we identify two qualitatively different approaches to gauging qLDPC codes to…
Simulating higher-order topological materials in synthetic quantum matter is an active research frontier for its theoretical significance in fundamental physics and promising applications in quantum technologies. Here we experimentally…
The practical use of many types of near-term quantum computers requires accounting for their limited connectivity. One way of overcoming limited connectivity is to insert swaps in the circuit so that logical operations can be performed on…
Cat states are an important resource for fault-tolerant quantum computing, where they serve as building blocks for a variety of fault-tolerant primitives. Consequently, the ability to prepare high-quality cat states at large fault distances…