Related papers: Implementation of Quantum Fourier Transform and Qu…
We demonstrate the applicability of a universal gate set in the parity encoding, which is a dual to the standard gate model, by exploring several quantum gate algorithms such as the quantum Fourier transform and quantum addition. Embedding…
Algorithms for processing data in short-time batches are critical for both online and offline processing of streamed and large data respectively due to the quadratic relation between signal length and computational cost of convolution-based…
To execute quantum circuits on a quantum processor, they must be modified to meet the physical constraints of the quantum device. This process, called quantum circuit mapping, results in a gate/circuit depth overhead that depends on both…
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…
Existing quantum compilers optimize quantum circuits by applying circuit transformations designed by experts. This approach requires significant manual effort to design and implement circuit transformations for different quantum devices,…
Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or compilation. This means that the number…
Universal quantum computation may be realized based on quantum walk, by formulating it as a scattering problem on a graph. In this paper, we simulate quantum gates through electric circuits, following a recent report that a one-dimensional…
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…
In this paper, we describe a parameterized quantum circuit that can be considered as convolutional and pooling layers for graph neural networks. The circuit incorporates the parameterized quantum Fourier circuit where the qubit connections…
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…
The Quantum Fourier Transform (QFT) is required by hidden subgroup problem (HSP) algorithms, including Shor's algorithm for factoring. The circuit depth of the QFT remains challenging for near-term hardware. To find shallower alternatives…
We investigate the counterparts of random walk in universal quantum computing and their implementation using standard quantum circuits. Quantum walk have been recently well investigated for traversing graphs with certain oracles. We focus…
To demonstrate supremacy of quantum computing, increasingly large-scale superconducting quantum computing chips are being designed and fabricated. However, the complexity of simulating quantum systems poses a significant challenge to…
Quantum fingerprinting is a technique that maps classical input word to a quantum state. The obtained quantum state is much shorter than the original word, and its processing uses less resources, making it useful in quantum algorithms,…
NISQ devices have inherent limitations in terms of connectivity and hardware noise. The synthesis of CNOT circuits considers the physical constraints and transforms quantum algorithms into low-level quantum circuits that can execute on…
Despite quantum computing's rapid development, current systems remain limited in practical applications due to their limited qubit count and quality. Various technologies, such as superconducting, trapped ions, and neutral atom quantum…
Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…
Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally…
Recent hardware demonstrations and advances in circuit compilation have made quantum computing with higher-dimensional systems (qudits) on near-term devices an attractive possibility. Some problems have more natural or optimal encodings…
We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits. This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation. Our method finds explicit quantum…