Systematic construction of topological-nontopological hybrid universal quantum gates based on many-body Majorana fermion interactions

• URL: http://arxiv.org/abs/2304.06260v2
• Date: Wed, 6 Sep 2023 01:10:44 GMT
• Title: Systematic construction of topological-nontopological hybrid universal quantum gates based on many-body Majorana fermion interactions
• Authors: Motohiko Ezawa
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Topological quantum computation by way of braiding of Majorana fermions is not universal quantum computation. There are several attempts to make universal quantum computation by introducing some additional quantum gates or quantum states. However, there is an embedding problem that $M$-qubit gates cannot be embedded straightforwardly in $N$ qubits for $N>M$. This problem is inherent to the Majorana system, where logical qubits are different from physical qubits because braiding operations preserve the fermion parity. By introducing $2N$-body interactions of Majorana fermions, topological-nontopological hybrid universal quantum computation is shown to be possible. Especially, we make a systematic construction of the C$^{n}$Z gate, C$^{n}$NOT gate and the C$^{n}$SWAP gate.

Related papers

• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem. We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions. We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Quantum channels, complex Stiefel manifolds, and optimization [45.9982965995401]
  We establish a continuity relation between the topological space of quantum channels and the quotient of the complex Stiefel manifold. The established relation can be applied to various quantum optimization problems.
  arXiv  Detail & Related papers  (2024-08-19T09:15:54Z)
• The power of shallow-depth Toffoli and qudit quantum circuits [3.212381039696143]
  One of the main goals of quantum circuit complexity is to find problems that can be solved by quantum shallow circuits but require more computational resources classically. We prove new separations between classical and quantum constant-depth circuits. In the infinite-size gateset case, these quantum circuit classes for higher-dimensional Hilbert spaces do not offer any advantage to standard qubit implementations.
  arXiv  Detail & Related papers  (2024-04-28T07:44:27Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• Constant-depth circuits for Uniformly Controlled Gates and Boolean functions with application to quantum memory circuits [42.979881926959486]
  We propose two types of constant-depth constructions for implementing Uniformly Controlled Gates. We obtain constant-depth circuits for the quantum counterparts of read-only and read-write memory devices.
  arXiv  Detail & Related papers  (2023-08-16T17:54:56Z)
• Straddling-gates problem in multipartite quantum systems [20.428960719376164]
  We study a variant of quantum circuit complexity, the binding complexity. We show that any $m$partite Schmidt decomposable state has binding complexity linear in $m$, which hints its multi-separable property.
  arXiv  Detail & Related papers  (2021-10-13T16:28:12Z)
• 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)
• Sample Complexity of Learning Quantum Circuits [4.329298109272386]
  We prove that physical quantum circuits are PAC learnable on a quantum computer via empirical risk minimization. Our results provide a valuable guide for quantum machine learning in both theory and experiment.
  arXiv  Detail & Related papers  (2021-07-19T18:00:04Z)
• Universal quantum computation via quantum controlled classical operations [0.0]
  A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. We show that even a primitive computer capable of implementing only SWAP gates, can be lifted to universal quantum computing.
  arXiv  Detail & Related papers  (2021-04-13T18:00:13Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Universal topological quantum computation with strongly correlated Majorana edge modes [7.930410828384357]
  Majorana-based quantum gates are not complete for performing universal topological quantum computation. We show the application to Shor's integer factorization algorithm.
  arXiv  Detail & Related papers  (2020-04-07T12:03:14Z)

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.