Related papers: Improving fermionic variational quantum eigensolve…
Quantum computing has the potential to significantly speed up complex computational tasks, and arguably the most promising application area for near-term quantum computers is the simulation of quantum mechanics. To make the most of our…
We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As in previous work [Babbush et al., New…
We present the experimental realisation of a robust CNOT quantum gate using Majorana zero modes simulated on a photonic platform. Three Kitaev chains supporting Majorana zero modes at their endpoints are used to encode two logical qubits,…
Majorana-based quantum computation in nanowires and neutral atoms has gained prominence as a promising platform to encode qubits and protect them against noise. In order to run computations reliably on such devices, a fully fault-tolerant…
Quantum computing applications in the noisy intermediate-scale quantum (NISQ) era require algorithms that can generate shallower circuits feasible for today's quantum systems. This is particularly challenging for quantum chemistry…
One of the main challenges for quantum computation is that while the number of gates required to perform a non-trivial quantum computation may be very large, decoherence and errors in realistic quantum architectures limit the number of…
Variational quantum algorithms (VQAs) have been proposed as one of the most promising approaches to demonstrate quantum advantage on noisy intermediate-scale quantum (NISQ) devices. However, it has been unclear whether VQAs can maintain…
Simulating molecular systems on quantum computers requires efficient mappings from Fermionic operators to qubit operators. Traditional mappings such as Jordan-Wigner or Bravyi-Kitaev often produce high-weight Pauli terms, increasing circuit…
Majorana-based quantum gates are not complete for performing universal topological quantum computation while Fibonacci-based gates are difficult to be realized electronically and hardly coincide with the conventional quantum circuit models.…
In this work we present a method for generating a fermionic encoding tailored to a set of target fermionic operators and to a target hardware connectivity. Our method uses brute force search, over the space of all encodings which map from…
We describe how microwave spectroscopy of cold fermions in quasi-1D traps can be used to detect, manipulate, and entangle exotic non-local qbits associated with "Majorana" edge modes. We present different approaches to generate the p-wave…
We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed…
Quantum Approximate Optimization Algorithm (QAOA) and its variants exhibit immense potential in tackling combinatorial optimization challenges. However, their practical realization confronts a dilemma: the requisite circuit depth for…
The prospects for realizing a topological quantum computer have brightened since the apparent detection of Majorana fermions at the ends of semiconducting nanowires. These Majorana zero-modes persist in the presence of the strong disorder…
We investigate the Josephson effect in one triple-terminal junction with embedded parallel-coupled double quantum dots. It is found that the inter-superconductor supercurrent has opportunities to oscillate in $4\pi$ period, with the…
Quantum tomography is an important tool for the characterisation of quantum operations. In this paper, we present a framework of quantum tomography in fermionic systems. Compared with qubit systems, fermions obey the superselection rule,…
The Variational Quantum Eigensolver (VQE) is a method of choice to solve the electronic structure problem for molecules on near-term gate-based quantum computers. However, the circuit depth is expected to grow significantly with problem…
The boundary of topological superconductors might lead to the appearance of Majorana edge modes, whose non-trivial exchange statistics can be used for topological quantum computing. In branched nanowire networks one can exchange Majorana…
We initiate the study of Majorana fermion codes. These codes can be viewed as extensions of Kitaev's 1D model of unpaired Majorana fermions in quantum wires to higher spatial dimensions and interacting fermions. The purpose of Majorana…
Majorana zero modes (MZMs) are promising candidates for topologically-protected quantum computing hardware, however their large-scale use will likely require quantum error correction. Majorana surface codes (MSCs) have been proposed to…