Universality for Sets of Three-Valued Qubit Gates
- URL: http://arxiv.org/abs/2109.07282v3
- Date: Sat, 16 Oct 2021 00:48:50 GMT
- Title: Universality for Sets of Three-Valued Qubit Gates
- Authors: Carlos Efrain Quintero Narvaez
- Abstract summary: We will do a review of the theory behind some essential proofs of quantum gate universality for qubit gates.
We will then show a new way of extending those statements to arbitrary qutrit gates in an analogous manner.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: How to find universal sets quantum gates (gates whose composition can form
any othergate within a given range) is an important part of the development of
quantum computation science that has been explored in the past with success.
However, there has not been much development in extending this very same theory
to a generalization of qubits known as quregisters or as we call them here
qunits (quantum units of information analogous to qubits that use any natural
number n of basis states instead of 2 as qubits do). In this paper we will
first do a review of the theory behind some essential proofs of quantum gate
universality for qubit gates. After that we will show a new way of extending
those statements to arbitrary qutrit gates in an analogous manner.
Related papers
- Universal Quantum Computing with Field-Mediated Unruh--DeWitt Qubits [0.0]
A set of universal quantum gates is a vital part of the theory of quantum computing.
UDW detectors in simple settings enable a collection of gates known to provide universal quantum computing.
arXiv Detail & Related papers (2024-02-15T18:19:45Z) - Universal Quantum Computation via Superposed Orders of Single-Qubit
Gates [7.796917261490019]
We prove that any two-qubit controlled quantum gate can be deterministically realized.
Superposed orders of single-qubit gates can enable universal quantum computation.
arXiv Detail & Related papers (2023-11-22T19:10:57Z) - A vertical gate-defined double quantum dot in a strained germanium
double quantum well [48.7576911714538]
Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation.
We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well.
We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
arXiv Detail & Related papers (2023-05-23T13:42:36Z) - Quantum Circuit Completeness: Extensions and Simplifications [44.99833362998488]
The first complete equational theory for quantum circuits has only recently been introduced.
We simplify the equational theory by proving that several rules can be derived from the remaining ones.
The complete equational theory can be extended to quantum circuits with ancillae or qubit discarding.
arXiv Detail & Related papers (2023-03-06T13:31:27Z) - 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) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - A Complete Equational Theory for Quantum Circuits [58.720142291102135]
We introduce the first complete equational theory for quantum circuits.
Two circuits represent the same unitary map if and only if they can be transformed one into the other using the equations.
arXiv Detail & Related papers (2022-06-21T17:56:31Z) - 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) - 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) - Constructing quantum circuits with global gates [0.0]
A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates.
A CNOT gate is however not always the natural multi-qubit interaction that can be implemented on a given physical quantum computer.
This calls for an entirely different approach to constructing efficient circuits.
arXiv Detail & Related papers (2020-12-16T16:29:23Z) - Compiling single-qubit braiding gate for Fibonacci anyons topological
quantum computation [0.0]
Topological quantum computation is an implementation of a quantum computer in a way that radically reduces decoherence.
Topological qubits are encoded in the topological evolution of two-dimensional quasi-particles called anyons.
arXiv Detail & Related papers (2020-08-08T15:34:03Z)
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.