Related papers: Implementations of more general solid-state (SWAP)$^{1/m}$ and controlled-(swap)$^{1/m}$ gates

Implementations of more general solid-state (SWAP)$^{1/m}$ and controlled-(swap)$^{1/m}$ gates

URL: http://arxiv.org/abs/2001.03428v1
Date: Fri, 10 Jan 2020 13:21:45 GMT
Title: Implementations of more general solid-state (SWAP)$^{1/m}$ and controlled-(swap)$^{1/m}$ gates
Authors: Wen-Qiang Liu and Hai-Rui Wei
Abstract summary: Universal quantum gates are the core elements in quantum information processing. We design two schemes to realize more general (SWAP)$1/m$ gates. $m$ is easily controlled by adjusting two quarter-wave plates and one half-wave plate.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Universal quantum gates are the core elements in quantum information processing. We design two schemes to realize more general (SWAP)$^{1/m}$ and controlled--(swap)$^{1/m}$ gates (for integer $m\geq1$) by directing flying single photons to solid--state quantum dots. The parameter $m$ is easily controlled by adjusting two quarter--wave plates and one half--wave plate. Additional computational qubits are not required to construct the two gates. Evaluations of the gates indicate that our proposals are feasible with current experimental technology.

Related papers

Parametrized multiqubit gate design for neutral-atom based quantum platforms [0.0]
A clever choice and design of gate sets can reduce the depth of a quantum circuit, and can improve the quality of the solution one obtains from a quantum algorithm. Parametrized gates in particular have found use in both near-term algorithms and circuit compilation.
arXiv Detail & Related papers (2024-11-29T15:47:19Z)
Gradient projection method for constrained quantum control [50.24983453990065]
We adopt the Gradient Projection Method (GPM) to problems of quantum control. The main advantage of the method is that it allows to exactly satisfy the bounds. We apply the GPM to several examples including generation of one- and two-qubit gates and two-qubit Bell and Werner states.
arXiv Detail & Related papers (2024-11-29T11:56:55Z)
All You Need is pi: Quantum Computing with Hermitian Gates [0.0]
We show that any single-qubit operator may be implemented as two Hermitian gates, and thus a purely Hermitian universal set is possible. This implementation can be used to prepare high fidelity single-qubit states in the presence of amplitude errors. We show that a gate set comprised of $pi$ rotations about two fixed axes, along with the CNOT gate, is universal for quantum computation.
arXiv Detail & Related papers (2024-02-19T18:36:09Z)
Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates [40.56175933029223]
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)
Universal qudit gate synthesis for transmons [44.22241766275732]
We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
arXiv Detail & Related papers (2022-12-08T18:59:53Z)
Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z)
Halving the cost of quantum multiplexed rotations [0.0]
We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls. Our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations.
arXiv Detail & Related papers (2021-10-26T06:49:44Z)
SWAP Test for an Arbitrary Number of Quantum States [4.989480853499916]
We develop an algorithm to generalize the quantum SWAP test for an arbitrary number $m$ of quantum states. We construct a quantum circuit able to simultaneously measure overlaps of $m$ arbitrary pure states.
arXiv Detail & Related papers (2021-10-25T20:53:44Z)
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)
Computational advantage from quantum superposition of multiple temporal orders of photonic gates [0.0]
A control quantum system can coherently determine the order in which a target quantum system undergoes $N$ gate operations. We experimentally demonstrate the quantum $N$-switch with $N=4$ gates acting on a photonic-polarization qubit. This is the first observation of a quantum superposition of more than $N=2$ temporal orders.
arXiv Detail & Related papers (2020-02-18T19:00:01Z)

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