Constructing three-qubit unitary gates in terms of Schmidt rank and CNOT gates

• URL: http://arxiv.org/abs/2007.02490v1
• Date: Mon, 6 Jul 2020 01:16:26 GMT
• Title: Constructing three-qubit unitary gates in terms of Schmidt rank and CNOT gates
• Authors: Zhiwei Song, Lin Chen, Mengyao Hu
• Abstract summary: We explicitly construct the gates of Schmidt rank from one to seven. We implement the gates using quantum circuits of CNOT gates and local Hadamard and flip gates.
• Score: 6.127256542161883
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: It is known that every two-qubit unitary operation has Schmidt rank one, two or four, and the construction of three-qubit unitary gates in terms of Schmidt rank remains an open problem. We explicitly construct the gates of Schmidt rank from one to seven. It turns out that the three-qubit Toffoli and Fredkin gate respectively have Schmidt rank two and four. As an application, we implement the gates using quantum circuits of CNOT gates and local Hadamard and flip gates. In particular, the collective use of three CNOT gates can generate a three-qubit unitary gate of Schmidt rank seven in terms of the known Strassen tensor from multiplicative complexity. Our results imply the connection between the number of CNOT gates for implementing multiqubit gates and their Schmidt rank.

Related papers

• Geometric Quantum Machine Learning with Horizontal Quantum Gates [41.912613724593875]
  We propose an alternative paradigm for the symmetry-informed construction of variational quantum circuits. We achieve this by introducing horizontal quantum gates, which only transform the state with respect to the directions to those of the symmetry. For a particular subclass of horizontal gates based on symmetric spaces, we can obtain efficient circuit decompositions for our gates through the KAK theorem.
  arXiv  Detail & Related papers  (2024-06-06T18:04:39Z)
• Realization of permutation groups by quantum circuit [5.28912548711417]
  We exclusively utilize CNOT gates for implementing permutation groups generated by more than two elements. We explore all valid circuit diagrams containing exactly six CNOT gates to successfully execute the swap gate for (123)
  arXiv  Detail & Related papers  (2024-06-03T14:14:31Z)
• Quantum control landscape for generation of $H$ and $T$ gates in an open qubit with both coherent and environmental drive [57.70351255180495]
  An important problem in quantum computation is generation of single-qubit quantum gates such as Hadamard ($H$) and $pi/8$ ($T$) Here we consider the problem of optimal generation of $H$ and $T$ gates using coherent control and the environment as a resource acting on the qubit via incoherent control.
  arXiv  Detail & Related papers  (2023-09-05T09:05:27Z)
• Cat-qubit-inspired gate on cos($2\theta$) qubits [77.34726150561087]
  We introduce a single-qubit $Z$ gate inspired by the noise-bias preserving gate of the Kerr-cat qubit. This scheme relies on a $pi$ rotation in phase space via a beamsplitter-like transformation between a qubit and ancilla qubit.
  arXiv  Detail & Related papers  (2023-04-04T23:06:22Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Decomposition of Multi-controlled Special Unitary Single-Qubit Gates [1.412197703754359]
  Multi-controlled unitary gates have been a subject of interest in quantum computing since its inception. Current state-of-the-art approach to implementing n-qubit multi-controlled gates involves the use of a quadratic number of single-qubit and CNOT gates. We present a new decomposition of n-qubit multi-controlled SU(2) gates that requires a circuit with a number of CNOT gates proportional to 20n.
  arXiv  Detail & Related papers  (2023-02-13T14:08:53Z)
• Classification of Schmidt-rank-two multipartite unitary gates by singular number [12.414561605185497]
  We investigate the classification of genuine multipartite unitary gates of Schmidt rank two. For genuine multipartite unitary gates of Schmidt rank two, there is an essential fact that their Schmidt decompositions are unique. We show that a three-qubit diagonal unitary gate has Schmidt rank at most three, and present a necessary and sufficient condition for such a unitary gate of Schmidt rank three.
  arXiv  Detail & Related papers  (2022-08-20T04:22:12Z)
• Extensive characterization of a family of efficient three-qubit gates at the coherence limit [0.4471952592011114]
  We implement a three-qubit gate by simultaneously applying two-qubit operations. We generate two classes of entangled states, the GHZ and W states, by applying the new gate only once. We analyze the experimental and statistical errors on the fidelity of the gates and of the target states.
  arXiv  Detail & Related papers  (2022-07-06T19:42:29Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)
• Optimal synthesis of the Fredkin gate in a multilevel system [0.0]
  optimal cost of a three-qubit Fredkin gate is 5 two-qubit entangling gates, and the overhead climbs to 8 when restricted to controlled-not (CNOT) gates. We reduce the cost of a three-qubit Fredkin gate from 8 CNOTs to 5 nearest-neighbor CNOTs. The cost of a nondeterministic three-qubit Fredkin gate is further reduced to 4 nearest-neighbor CNOTs, and the success of such a gate is heralded by a single-photon detector.
  arXiv  Detail & Related papers  (2020-04-07T05:36:34Z)

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.