A T-depth two Toffoli gate for 2D square lattice architectures

• URL: http://arxiv.org/abs/2311.12510v1
• Date: Tue, 21 Nov 2023 10:33:51 GMT
• Title: A T-depth two Toffoli gate for 2D square lattice architectures
• Authors: Alexandru Paler, Evan E. Dobbs, Joseph S. Friedman
• Abstract summary: We present a novel Clifford+T decomposition of a Toffoli gate. Our decomposition requires no SWAP gates in order to be implemented on 2D square lattices of qubits. This decomposition enables shallower, more fault-tolerant quantum computations on both NISQ and error-corrected architectures.
• Score: 49.88310438099143
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a novel Clifford+T decomposition of a Toffoli gate. Our decomposition requires no SWAP gates in order to be implemented on 2D square lattices of qubits. This decomposition enables shallower, more fault-tolerant quantum computations on both NISQ and error-corrected architectures. We present the derivation of the circuit, and illustrate the qubit mapping on a Sycamore-like architecture.

Related papers

• Approximate t-designs in generic circuit architectures [0.0]
  Unitary t-designs are distributions on the unitary group whose first t moments appear maximally random. Previous work has established several upper bounds on the depths at which certain random quantum circuit ensembles approximate t-designs. Here we show that these bounds can be extended to any fixed architecture of Haar-random two-site gates.
  arXiv  Detail & Related papers  (2023-10-30T17:49:44Z)
• Variational Quantum Algorithm based circuit that implements the Toffoli gate with multi inputs [0.0]
  This study seeks a circuit diagram for a multi-inputs Toffoli gate including only single qubit gates and CNOTs. We have developed two variational quantum algorithms that can be used to implement a multi-inputs Toffoli gate.
  arXiv  Detail & Related papers  (2023-05-30T05:10:08Z)
• Optimal, hardware native decomposition of parameterized multi-qubit Pauli gates [0.0]
  We show how to efficiently decompose a parameterized multi-qubit Pauli (PMQP) gate into native parameterized two-qubit Pauli (P2QP) gates. Given a realistic quantum computational model, we argue that the technique is optimal in terms of the number of hardware native gates and the overall depth of the decomposition.
  arXiv  Detail & Related papers  (2023-03-08T10:42:43Z)
• Low-depth simulations of fermionic systems on square-grid quantum hardware [0.0]
  We present a strategy for mapping fermionic systems to quantum hardware with square qubit connectivity. We report unprecedentedly low circuit depths per single Trotter layer with up to a $70 %$ improvement upon previous state-of-the-art.
  arXiv  Detail & Related papers  (2023-02-03T17:08:26Z)
• Quantum Fourier Addition, Simplified to Toffoli Addition [92.18777020401484]
  We present the first systematic translation of the QFT-addition circuit into a Toffoli-based adder. Instead of using approximate decompositions of the gates from the QFT circuit, it is more efficient to merge gates.
  arXiv  Detail & Related papers  (2022-09-30T02:36:42Z)
• Efficient variational synthesis of quantum circuits with coherent multi-start optimization [1.3108652488669734]
  We consider the problem of synthesis into a gate set consisting of the CNOT gate and arbitrary single-qubit (1q) gates. A key idea we propose is to use parametrized two-qubit (2q) controlled phase gates, which can interpolate between the identity gate and the CNOT gate. This coherent optimization of the architecture together with 1q gates appears to work surprisingly well in practice.
  arXiv  Detail & Related papers  (2022-05-02T18:00:03Z)
• Hierarchical Graph Networks for 3D Human Pose Estimation [50.600944798627786]
  Recent 2D-to-3D human pose estimation works tend to utilize the graph structure formed by the topology of the human skeleton. We argue that this skeletal topology is too sparse to reflect the body structure and suffer from serious 2D-to-3D ambiguity problem. We propose a novel graph convolution network architecture, Hierarchical Graph Networks, to overcome these weaknesses.
  arXiv  Detail & Related papers  (2021-11-23T15:09:03Z)
• 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)
• 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)
• Generating Diverse Structure for Image Inpainting With Hierarchical VQ-VAE [74.29384873537587]
  We propose a two-stage model for diverse inpainting, where the first stage generates multiple coarse results each of which has a different structure, and the second stage refines each coarse result separately by augmenting texture. Experimental results on CelebA-HQ, Places2, and ImageNet datasets show that our method not only enhances the diversity of the inpainting solutions but also improves the visual quality of the generated multiple images.
  arXiv  Detail & Related papers  (2021-03-18T05:10:49Z)

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.