Complete description of fault-tolerant quantum gate operations for
topological Majorana qubit systems
- URL: http://arxiv.org/abs/2201.05160v1
- Date: Thu, 13 Jan 2022 19:00:00 GMT
- Title: Complete description of fault-tolerant quantum gate operations for
topological Majorana qubit systems
- Authors: Adrian Scheppe and Michael Pak
- Abstract summary: Quantum decoherence generates losses to the environment within a computational system which cannot be recovered via error correction methods.
A promising solution bases the computational states on the low lying energy excitations within topological materials.
The existence of these states is protected by a global parameter within the Hamiltonian which prevents the computational states from coupling locally and decohering.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-sa/4.0/
- Abstract: Among the list of major threats to quantum computation, quantum decoherence
poses one of the largest because it generates losses to the environment within
a computational system which cannot be recovered via error correction methods.
These methods require the assumption that the environmental interaction forces
the qubit state into some linear combination of qubit eigenstates. In reality,
the environment causes the qubit to enter into a mixed state where the original
is no longer recoverable. A promising solution to this problem bases the
computational states on the low lying energy excitations within topological
materials. The existence of these states is protected by a global parameter
within the Hamiltonian which prevents the computational states from coupling
locally and decohering. In this paper, the qubit is based on nonlocal,
topological Majorana fermions (MF), and the gate operations are generated by
swapping or braiding the positions of said MF. The algorithmic calculation for
such gate operations is well known, but, the opposite gates-to-braid
calculation is currently underdeveloped. Additionally, because one may choose
from a number of different possible qubit definitions, the resultant gate
operations from calculation to calculation appear different. Here, the
calculations for the two- and four-MF cases are recapitulated for the sake of
logical flow. This set of gates serves as the foundation for the understanding
and construction of the six-MF cases. Using these, a full characterization of
the system is made by completely generalizing the list of gates and
transformations between possible qubit definitions. A complete description of
this system is desirable and will hopefully serve future iterations of
topological qubits.
Related papers
- Classical simulation of parity-preserving quantum circuits [0.0]
We present a classical simulation method for fermionic quantum systems without loss of generality.
We map such circuits to a fermionic tensor network and introduce a novel decomposition of non-Matchgate gates.
Our algorithm significantly lowers resource requirements for simulating parity-preserving circuits while retaining high accuracy.
arXiv Detail & Related papers (2025-04-27T17:42:39Z) - Efficient Representation of Gaussian Fermionic Pure States in Non-Computational Bases [0.0]
This paper introduces an innovative approach for representing Gaussian fermionic states, pivotal in quantum spin systems and fermionic models.
We focus on transitioning these states from the conventional computational (sigmaz) basis to more complex bases, such as (phi, fracpi2, alpha)
We present a novel algorithm that not only simplifies the basis transformation but also reduces computational complexity.
arXiv Detail & Related papers (2024-03-05T19:43:33Z) - A complete continuous-variable quantum computation architecture based on the 2D spatiotemporal cluster state [5.00127829918438]
Continuous-variable measurement-based quantum computation is a promising candidate for practical, scalable, universal, and fault-tolerant quantum computation.
In this work, a complete architecture including cluster state preparation, gate implementations, and error correction is proposed.
arXiv Detail & Related papers (2023-12-21T14:21:33Z) - A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits [37.84307089310829]
Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit.
Despite their promise, the trainability of these algorithms is hindered by barren plateaus.
We present a general Lie algebra that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits.
arXiv Detail & Related papers (2023-09-17T18:14:10Z) - Improved simulation of quantum circuits dominated by free fermionic operations [1.024113475677323]
We present an algorithm for simulating universal quantum circuits composed of "free" nearest-neighbour matchgates or equivalently fermionic-linear-optical (FLO) gates, and "resourceful" non-Gaussian gates.
Our key contribution is the development of a novel phase-sensitive algorithm for simulating FLO circuits.
For a quantum circuit containing arbitrary FLO unitaries and $k$ controlled-Z gates, we obtain an exponential improvement $k$O(4.5k)$O over the prior state-of-the-art.
arXiv Detail & Related papers (2023-07-24T11:36:28Z) - Impact of decoherence on the fidelity of quantum gates leaving the
computational subspace [0.0]
We show the average gate fidelity of a general multiqubit operation in terms of the dissipative rates and the corresponding Lindblad jump operators.
These results are useful for understanding the error budgets of quantum gates while scaling up quantum computers.
arXiv Detail & Related papers (2023-02-27T15:31:52Z) - Non-local finite-depth circuits for constructing SPT states and quantum
cellular automata [0.24999074238880484]
We show how to implement arbitrary translationally invariant quantum cellular automata in any dimension using finite-depth circuits of $k$-local gates.
Our results imply that the topological classifications of SPT phases and QCA both collapse to a single trivial phase in the presence of $k$-local interactions.
arXiv Detail & Related papers (2022-12-13T19:00:00Z) - Transversal Injection: A method for direct encoding of ancilla states
for non-Clifford gates using stabiliser codes [55.90903601048249]
We introduce a protocol to potentially reduce this overhead for non-Clifford gates.
Preliminary results hint at high quality fidelities at larger distances.
arXiv Detail & Related papers (2022-11-18T06:03:10Z) - Simulating scalar field theories on quantum computers with limited
resources [62.997667081978825]
We present a quantum algorithm for implementing $phi4$ lattice scalar field theory on qubit computers.
The algorithm allows efficient $phi4$ state preparation for a large range of input parameters in both the normal and broken symmetry phases.
arXiv Detail & Related papers (2022-10-14T17:28:15Z) - Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra.
A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
arXiv Detail & Related papers (2022-09-28T20:24:53Z) - Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions.
We explore novel schemes for universal logic that improve resource overheads.
Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
arXiv Detail & Related papers (2021-12-22T19:00:03Z) - 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) - 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)
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.