Related papers: T-count optimization of approximate quantum Fourier transform

T-count optimization of approximate quantum Fourier transform

URL: http://arxiv.org/abs/2203.07739v5
Date: Mon, 22 Jul 2024 05:25:59 GMT
Title: T-count optimization of approximate quantum Fourier transform
Authors: Byeongyong Park, Doyeol Ahn,
Abstract summary: We present a new n-qubit QFT circuit approximated to error O(varepsilon) using Toffoli gates and quantum adders.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: The quantum Fourier transform (QFT) is a ubiquitous quantum operation that is used in numerous quantum computing applications. The major obstacle to constructing a QFT circuit is that numerous elementary gates are required. Among the elementary gates, T gates dominate the cost of fault-tolerant implementation. Currently, the smallest-known T-count required to construct an n-qubit QFT circuit approximated to error O(\varepsilon) is ~8nlog_2(n/\varepsilon). Moreover, the depth of T gates (T-depth) in the approximate QFT circuit is ~2nlog_2(n/\varepsilon). This approximate QFT circuit was constructed using Toffoli gates and quantum adders. In this study, we present a new n-qubit QFT circuit approximated to error O(\varepsilon). Our approximate QFT circuit shows a T-count of ~4nlog_2(n/\varepsilon) and a T-depth of ~nlog_2(n/\varepsilon). Toffoli gates, which account for half of the T-count in the approximate QFT circuit reported in the previous study, are unnecessary in our construction. Quantum adders, which dominate the leading order term of T-depth in our approximate QFT circuit, are arranged in parallel to reduce T-depth.

Related papers

The exact lower bound of CNOT-complexity for fault-tolerant quantum Fourier transform [9.657072841833243]
We study the exact lower bound problem of CNOT gate complexity for fault-tolerant QFT. Our work can provide a reference for designing algorithms based on active defense in a quantum setting.
arXiv Detail & Related papers (2024-09-04T08:06:11Z)
Multidimensional Quantum Fourier Transformation [0.0]
In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. An example on current hardware is depicted by a 6 qubit 2D-QFT with an IBM quantum computer.
arXiv Detail & Related papers (2023-01-31T18:25:40Z)
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)
An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
arXiv Detail & Related papers (2021-08-06T19:38:03Z)
On the realistic worst case analysis of quantum arithmetic circuits [69.43216268165402]
We show that commonly held intuitions when designing quantum circuits can be misleading. We show that reducing the T-count can increase the total depth. We illustrate our method on addition and multiplication circuits using ripple-carry.
arXiv Detail & Related papers (2021-01-12T21:36:16Z)
Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
arXiv Detail & Related papers (2020-07-29T05:26:19Z)
QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z)
T-count and Qubit Optimized Quantum Circuit Designs of Carry Lookahead Adder [0.966840768820136]
Quantum circuits of arithmetic operations such as addition are needed to implement quantum algorithms in hardware. Quantum circuits based on Clifford+T gates are used as they can be made tolerant to noise. The T-count performance measure has become important in quantum circuit design.
arXiv Detail & Related papers (2020-04-04T01:07:50Z)
On estimating the entropy of shallow circuit outputs [49.1574468325115]
Estimating the entropy of probability distributions and quantum states is a fundamental task in information processing. We show that entropy estimation for distributions or states produced by either log-depth circuits or constant-depth circuits with gates of bounded fan-in and unbounded fan-out is at least as hard as the Learning with Errors problem.
arXiv Detail & Related papers (2020-02-27T15:32:08Z)
Discretizing quantum field theories for quantum simulation [0.0]
We show that a timestep equal to or going to zero faster than the spatial lattice spacing is necessary for quantum simulations of QFT. We give a quantum circuit exactly equivalent to the real-time path integral from the discrete-time Lagrangian formulation of lattice QFT. All of these circuits have an analogue of a lightcone on the lattice and therefore are examples of quantum cellular automata.
arXiv Detail & Related papers (2020-02-07T06:55:51Z)

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