We preform dynamic state evolution on an IBM quantum computer using a simulation of braiding Majorana zero modes as a benchmark for success. We find the native quantum gates introduce too much noise to observe braiding. Instead, we use Qiskit Pulse to develop scaled 2-qubit quantum gates that better match the unitary time evolution operator and enable us to observe braiding. This paper demonstrates that quantum computers can be used for simulation, and highlights the use of pulse-level control for programming quantum computers and constitutes the first experimental evidence of braiding via dynamical Hamiltonian evolution.
A Jastrow-Gutzwiller operator adds many-body correlations to a quantum state. However, the operator is nonunitary, making it difficult to implement directly on a quantum computer. We present an implementation of the Jastrow-Gutzwiller operator using the cascaded variational quantum eigensolver algorithm. We demonstrate the method on IBM Q Lagos for a Hubbard model.
As an analogy to the Weyl point in -space, we search for energy levels which close at a single point as a function of a three-dimensional parameter space. Such points are topologically protected in the sense that any perturbation which acts on the two-level subsystem can be corrected by tuning the control parameters. We find that parameter-controlled Weyl points are ubiquitous in semiconductor-superconductor quantum dots and that they are deeply related to Majorana zero modes. In this paper, we present several semiconductor-superconductor quantum-dot devices which host parameter-controlled Weyl points. Furthermore, we show how these points can be observed experimentally via conductance measurements.
We present a hybrid classical-quantum algorithm for efficiently solving the eigenvalue problem of many-particle Hamiltonians on quantum computers with limited resources by splitting the workload between classical and quantum processors. This algorithm reduces the needed number of qubits at the expense of an increased number of quantum evaluations. We demonstrate the method for the Hubbard model and show how the conservation of the component of the total spin allows the spin-up and spin-down configurations to be computed on classical and quantum hardware, respectively. Other symmetries can be exploited in a similar manner.
Although Majorana platforms are promising avenues toward realizing topological quantum computing, they are still susceptible to errors from thermal noise and other sources. We show that the error rate of Majorana qubits can be drastically reduced using a one-dimensional repetition code. The success of the code is due the imbalance between the phase error rate and the flip error rate. We demonstrate how a repetition code can be naturally constructed from segments of Majorana nanowires. We find the optimal lifetime may be extended from a millisecond to over one second.