Related papers: Demonstrating Record Fidelity for the Quantum Four…
To overcome the difficulty of realizing large-scale quantum Fourier transform (QFT) within existing technology, this paper presents a resource-saving method, namely t-bit semiclassical QFT over (Z_(2^n)), which could realize large-scale QFT…
The quantum Fourier transform (QFT) has been implemented on a three bit nuclear magnetic resonance (NMR) quantum computer, providing a first step towards the realization of Shor's factoring and other quantum algorithms. Implementation of…
Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation…
As quantum processors grow, new performance benchmarks are required to capture the full quality of the devices at scale. While quantum volume is an excellent benchmark, it focuses on the highest quality subset of the device and so is unable…
Cloud-accessible quantum processors enable direct execution of quantum algorithms on heterogeneous hardware platforms. Unlike classical systems, however, identical quantum circuits may exhibit substantially different behavior across devices…
Quantum performance simulators can provide practical metrics for the effectiveness of executing theoretical quantum information processing protocols on physical hardware. In this work we present a scheme to simulate the performance of fault…
Quantum process tomography of each directly implementable quantum gate used in the IBM quantum processors is performed to compute gate error in order to check viability of complex quantum operations in the superconductivity-based quantum…
In dynamic quantum circuits, classical information from mid-circuit measurements is fed forward during circuit execution. This emerging capability of quantum computers confers numerous advantages that can enable more efficient and powerful…
The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route towards a numerical…
We present a formalism based on tracking the flow of parity quantum information to implement algorithms on devices with limited connectivity without qubit overhead, SWAP operations or shuttling. Instead, we leverage the fact that entangling…
Benchmarking large-scale quantum gates, typically involving multiple native two-qubit and singlequbit gates, is crucial in quantum computing. Global fidelity, encompassing information about intergate correlations, offers a comprehensive…
The accurate implementation of quantum gates is essential for the realisation of quantum algorithms and digital quantum simulations. This accuracy may be increased on noisy hardware through the variational optimisation of gates, however the…
The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the…
With the race to build large-scale quantum computers and efforts to exploit quantum algorithms for efficient problem solving in science and engineering disciplines, the requirement to have efficient and scalable verification methods are of…
With the continued scaling of quantum processors, holistic benchmarks are essential for extensively evaluating device performance. Layer fidelity is a benchmark well-suited to assessing processor performance at scale. Key advantages of this…
We present an asymptotically improved algorithm for implementing the Quantum Fourier Transform (QFT) in both the exact and approximate settings. Historically, the approximate QFT has been implemented in $\Theta(n \log n)$ gates, and the…
Rapid development in quantum computing leads to the appearance of several quantum applications. Quantum Fourier Transformation (QFT) sits at the heart of many of these applications. Existing work leverages SAT solver or heuristics to…
A quantum instruction set is where quantum hardware and software meet. We develop new characterization and compilation techniques for non-Clifford gates to accurately evaluate different quantum instruction set designs. We specifically apply…
Classical simulations are essential for the development of quantum computing, and their exponential scaling can easily fill any modern supercomputer. In this paper we consider the performance and energy consumption of large Quantum Fourier…
Quantum computation holds the promise of solving computational problems which are believed to be classically intractable. However, in practice, quantum devices are still limited by their relatively short coherence times and imperfect…