Universal topological quantum computation with strongly correlated Majorana edge modes

• URL: http://arxiv.org/abs/2004.03297v5
• Date: Tue, 22 Mar 2022 10:00:18 GMT
• Title: Universal topological quantum computation with strongly correlated Majorana edge modes
• Authors: Ye-Min Zhan, Yu-Ge Chen, Bin Chen, Ziqiang Wang, Yue Yu, Xi Luo
• Abstract summary: Majorana-based quantum gates are not complete for performing universal topological quantum computation. We show the application to Shor's integer factorization algorithm.
• Score: 7.930410828384357
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 Ref. \cite{hukane}, it has been shown that a strongly correlated Majorana edge mode in a chiral topological superconductor can be decomposed into a Fibobacci anyon $\tau$ and a thermal operator anyon $\varepsilon$ in the tricritical Ising model. The deconfinement of $\tau$ and $\varepsilon$ via the interaction between the fermion modes yields the anyon {collisions} and gives the braiding of either $\tau$ or $\varepsilon$. With these braidings, the complete members {of} a set of universal gates, the Pauli gates, the Hadamard gate and extra phase gates for 1-qubit as well as controlled-not gate for 2-qubits, are topologically assembled. Encoding quantum information and reading out the computation results can be carried out through electric signals. With the sparse-dense mixed encodings, we set up the quantum circuit {where the controlled-not gate turns out { to be} a probabilistic gate} and design the corresponding devices with thin films of the chiral topological superconductor. As an example of the universal topological quantum computing, we show the application to Shor's integer factorization algorithm.

Related papers

• Scalable quantum circuits for exponential of Pauli strings and Hamiltonian simulations [0.0]
  We design quantum circuits for the exponential of scaled $n$-qubit Pauli strings using single-qubit rotation gates, Hadamard gate, and CNOT gates. A key result we derive is that any two Pauli-string operators composed of identity and $X$ gates are permutation similar. We apply these circuit models to approximate unitary evolution for several classes of Hamiltonians using the Suzuki-Trotter approximation.
  arXiv  Detail & Related papers  (2024-05-22T12:57:09Z)
• Universal quantum computation using atoms in cross-cavity systems [0.0]
  We theoretically investigate a single-step implementation of both a universal two- (CNOT) and three-qubit (quantum Fredkin) gates in a cross-cavity setup. Within a high-cooper regime, the system exhibits an atomic-state-dependent $pi$-phase gate involving the two-mode single-photon bright and dark states.
  arXiv  Detail & Related papers  (2023-08-28T20:09:54Z)
• Systematic construction of topological-nontopological hybrid universal quantum gates based on many-body Majorana fermion interactions [0.0]
  Topological quantum computation by way of braiding of Majorana fermions is not universal quantum computation. We make a systematic construction of the C$n$Z gate, C$n$NOT gate and the C$n$SWAP gate.
  arXiv  Detail & Related papers  (2023-04-13T04:41:29Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Approaching the theoretical limit in quantum gate decomposition [0.0]
  We propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count. Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition.
  arXiv  Detail & Related papers  (2021-09-14T15:36:22Z)
• Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
  We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
  arXiv  Detail & Related papers  (2021-08-30T16:30:33Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Demonstration of a non-Abelian geometric controlled-Not gate in a superconducting circuit [14.11575652583778]
  We report the first on-chip realization of a non-Abelian geometric controlled-Not gate in a superconducting circuit. This gate represents an important step towards the all-geometric realization of scalable quantum computation on a superconducting platform.
  arXiv  Detail & Related papers  (2020-09-08T09:42:38Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.