Related papers: Preparing topological states with finite depth sim…
Two prevalent approaches for preparing long-range entangled quantum states are (i) linear-depth sequential unitary (SU) circuits, which apply local unitary gates sequentially, and (ii) constant-depth measurement-feedback (MF) circuits,…
Surface codes offer a very promising avenue towards fault-tolerant quantum computation. We argue that two-dimensional interacting networks of Majorana bound states in topological superconductor/semiconductor heterostructures hold several…
The power of a quantum circuit is determined through the number of two-qubit entangling gates that can be performed within the coherence time of the system. In the absence of parallel quantum gate operations, this would make the quantum…
Solid state superconducting devices coupled to coplanar transmission lines offer an exquisite architecture for quantum optical phenomena probing as well as for quantum computation implementation, being the object of intense theoretical and…
In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence…
A quantum algorithm can be decomposed into a sequence consisting of single qubit and 2-qubit entangling gates. To optimize the decomposition and achieve more efficient construction of the quantum circuit, we can replace multiple 2-qubit…
Quantum circuits currently constitute a dominant model for quantum computation. Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We…
We derive a rigorous upper bound on the classical computation time of finite-ranged tensor network contractions in $d \geq 2$ dimensions. Consequently, we show that quantum circuits of single-qubit and finite-ranged two-qubit gates can be…
We present a general strategy for mapping fermionic systems to quantum hardware with square qubit connectivity which yields low-depth quantum circuits, counted in the number of native two-qubit fSIM gates. We achieve this by leveraging…
Quantum algorithms can be realized in the form of a quantum circuit. To map quantum circuit for specific quantum algorithm to quantum hardware, qubit mapping is an imperative technique based on the qubit topology. Due to the neighbourhood…
Quantum state preparation is a critical task in quantum computing, particularly in fields such as quantum machine learning, Hamiltonian simulation, and quantum algorithm design. The depth of preparation circuit for the most general state…
Quantum low-density parity-check codes are promising candidates towards scalable fault-tolerant quantum computation. Among these, bivariate bicycle (BB) codes offer superior encoding rates and large code distance compared to surface codes.…
In a recent experiment, Barreiro et al. demonstrated the fundamental building blocks of an open-system quantum simulator with trapped ions [Nature 470, 486 (2011)]. Using up to five ions, single- and multi-qubit entangling gate operations…
Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally…
Since the first demonstration of coherent control of a quantum state of a superconducting charge qubit a variety of Josephson-junction-based qubits have been implemented with remarkable progress in coherence time and read-out schemes.…
Quantum computers have the potential to solve important problems which are fundamentally intractable on a classical computer. The underlying physics of quantum computing platforms supports using multi-valued logic, which promises a boost in…
In circuit-based quantum computing, the available gate set typically consists of single-qubit gates acting on each individual qubit and at least one entangling gate between pairs of qubits. In certain physical architectures, however, some…
Building blocks of quantum computers have been demonstrated in small to intermediate-scale systems. As one of the leading platforms, the trapped ion system has attracted wide attention. A significant challenge in this system is to combine…
We study the optimal quantum control of heteronuclear two-qubit systems described by a Hamiltonian containing both nonlocal internal drift and local control terms. We derive an explicit formula to compute the minimum time required to steer…
Long-range entangled states are vital for quantum information processing and quantum metrology. Preparing such states by combining measurements with unitary gates opened new possibilities for efficient protocols with finite-depth quantum…