Related papers: Fermionic quantum computation with Cooper pair spl…
We study how much noise can be tolerated by a universal gate set before it loses its quantum-computational power. Specifically we look at circuits with perfect stabilizer operations in addition to imperfect non-stabilizer gates. We prove…
A crucial requirement for scalable quantum-information processing is the realization of multiple-qubit quantum gates. Universal multiple-qubit gates can be implemented by a set of universal single qubit gates and any one kind of two-qubit…
An implementation of a universal solid-state quantum register based on electron space states in field-defined double quantum dots (DQD possesses one electron in two adjacent tunnel bound dots) in an ultrathin semiconductor nanowire is…
With the increasing size of quantum processors, sub-modules that constitute the processor hardware will become too large to accurately simulate on a classical computer. Therefore, one would soon have to fabricate and test each new design…
We show that the computational model based on local Fermionic modes in place of qubits does not satisfy local tomography and monogamy of entanglement, and has mixed states with maximal entanglement of formation. These features directly…
In a device with a superconductor coupled to two parallel quantum dots (QDs) the electrical tunability of the QD levels can be used to exploit non-classical current correlations due to the splitting of Cooper pairs. We experimentally…
We show that placing a quantum system in contact with an environment can enhance non-Fermi-liquid correlations, rather than destroy quantum effects as is typical. The system consists of two quantum dots in series with two leads; the highly…
The strong anharmonicity and high coherence times inherent to fluxonium superconducting circuits are beneficial for quantum information processing. In addition to requiring high-quality physical qubits, a quantum processor needs to be…
A large-scalable quantum computer model, whose qubits are represented by the subspace subtended by the ground state and the single exciton state on semiconductor quantum dots, is proposed. A universal set of quantum gates in this system may…
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…
We present a blueprint for building a fault-tolerant quantum computer using the spin states of electrons on the surface of liquid helium. We propose to use ferromagnetic micropillars to trap single electrons on top of them and to generate a…
We investigate theoretically the noise and the full counting statistics of electrons that are emitted from a superconductor into two spatially separated quantum dots by the splitting of Cooper pairs and further on collected in two…
A compelling application of quantum computers with thousands of qubits is quantum simulation. Simulating fermionic systems is both a problem with clear real-world applications and a computationally challenging task. In order to simulate a…
A defining feature in the field of quantum computing is the potential of a quantum device to outperform its classical counterpart for a specific computational task. By now, several proposals exist showing that certain sampling problems can…
We carry out a detailed analysis of coherent resonant tunneling through two coupled quantum dots (CQD) in a parallel arrangement in the weak tunneling limit. We establish a set of quantum rate equations (QREs) in terms of the…
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. Here, we explore the potential and limitations of such schemes in codes of all spatial dimensions. We…
The scalability of photonic implementations of fault-tolerant quantum computing based on Gottesman-Kitaev-Preskill (GKP) qubits is injured by the requirements of inline squeezing and reconfigurability of the linear optical network. In this…
Fermion-to-qubit mappings play a crucial role in representing fermionic interactions on a quantum computer. Efficient mappings translate fermionic modes of a system to qubit interactions with a high degree of locality while using few…
Noisy, intermediate-scale quantum computers come with intrinsic limitations in terms of the number of qubits (circuit "width") and decoherence time (circuit "depth") they can have. Here, for the first time, we demonstrate a recently…
Quantum states are usually fragile which makes quantum computation being not as stable as classical computation. Quantum correction codes can protect quantum states but need a large number of physical qubits to code a single logic qubit.…