Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 29 for “"Quantum fourier transform"”.
-
Efficient Quantum Multiplication in the Quantum Fourier Transform Domain
The subject of Quantum Computing is in its early stages of development, and new technologies and algorithms are constantly evolving. Even with all of this progress it is important to recognize that current quantum computers are still in their infancy and, as such, have notable issues. The ``era" …
-
Grid-based split operator-quantum fourier transform algorithms for time-dependent quantum simulation
… investigates the grid-based Split Operator–Quantum Fourier Transform (SO-QFT) scheme as a general-purpose backbone for time-dependent quantum simulation. We develop an end-to-end algorithmic framework that unifies state preparation on discretised grids, SO-QFT time propagation, and the …
-
Consensus Model of Families of Images using Tensor-based Fourier Analysis
… The consensus model is produced by utilizing the quantum Fourier transform of a family of images as tensors to transform images to images. We write a quantum Fourier transform in the numerical computation library for Python, known as Theano to produce the consensus spectrum. From the consensus …
-
Efficient Real Quantum Transforms with Applications to Quantum Money
We introduce new techniques for implementing quantum real transforms, focusing on the Hartley and sine transforms, and analyze how they can serve as efficient building blocks in quantum cryptographic protocols. In particular, we present an exact, recursive algorithm for the quantum Hartley …
-
Furjė transformacijos panaudojimo kvantiniuose kompiuteriuose tyrimas /
The Fourier transform is one of the most important mathematical transforms to decompose a signal or function into its component frequencies. It allows to analyse the given data in the frequency domain and to take advantage of its benefits: to simplify and reduce mathematical calculations and to …
-
The hidden subgroup problem for generalized quaternions
… hidden subgroup problem is a pivotal problem in quantum computation since it reflects the structure of tasks for which quantum algorithms significantly outperform classical algorithms. In this dissertation, a quantum algorithm that solves the hidden subgroup problem over the generalized …
-
Using the qubus for quantum computing
In this thesis I explore using the qubus for quantum computing. The qubus is an architecture of quantum computing, where a continuous variable ancilla is used to generate operations between matter qubits. I concentrate on using the qubus for two purposes - quantum simulation, and generating cluster …
-
Kvantiniai skaičiavimai baigtiniuose kūnuose /
… wide variety of applications. With the advent of quantum computing, algorithms are being researched to provide speedups over classical computing for finite fields. In this work, arithmetic operations for finite fields are implemented in quantum logic gate circuits using the quantum Fourier …
-
Higher-order semantics for quantum programming languages with classical control
… thesis studies the categorical formalisation of quantum computing, through the prism of type theory, in a three-tier process. The first stage of our investigation involves the creation of the dagger lambda calculus, a lambda calculus for dagger compact categories. Our second contribution lifts …
-
EVALUATION OF A PHYSICAL QUANTUM COMPUTER
In the past few years, IBM has expanded their Quantum Experience to include a high-level Python module called Qiskit as well as a 15-qubit machine (ibmq_16_melbourne). In order to evaluate IBM’s progress, we create an overview of the processes involved in developing and running an algorithm on …
-
Implementing Quantum Gates With Length-3 Dynamic Graphs
The continuous-time quantum walk is a quantum version of a random walk that evolves by Schrodinger's equation. With the Hamiltonian equal to the adjacency matrix of a sequence of graphs, called a dynamic graph, continuous-time quantum walks have been shown to implement quantum gates, including the …
-
Kvantinio kompiuterio kubitų analizė kvantinės chemijos metodu /
… University Faculty of Physics and “Qiskit” quantum computer simulation package and performing QFT and qubit teleportation simulations. After completing the analysis of PPN molecule, through-space coupling constants J were found to be in the range of 200-280 Hz, which is similar to …
-
Quantum programming and synthesis: Internalizing Clifford operations and beyond
Clifford operations are a subset of quantum operations used extensively in quantum error correction and classical simulation of quantum circuits. The first part of the thesis is motivated by the problem of programming with generalized Clifford operations, such as the quantum Fourier transform. We …
-
A Taxonomy of Quantum Algorithms - The core ideas of existing quantum algorithms and their implications on cryptography
With quantum computers coming up as one of the fastest growing areas in multiple research areas, such as computer science and physics, a taxonomy of the existing quantum algorithms is necessary. However, before this thesis, no taxonomy which included many of the existing quantum algorithms could be …
-
Quantum Walks and Application to Quantum Money
This thesis explores the foundations of quantum computation, focusing on quantum walks and their application to quantum money. Quantum walks, particularly continuous-time quantum walks based on group actions, serve as a powerful computational tool with applications in search algorithms and …
-
Designing Optical Quantum Computing with Minimal Hardware
Photons, while indispensable for quantum communication and metrology, fall short due to limited photon-photon interactions, thus suboptimal for quantum computing. This thesis explores the use of an atom-photon interface to foster entanglement between photons, thereby facilitating more scalable …
-
Graph-Theoretic Techniques for Optimizing NISQ Algorithms
… the NISQ era, the search for useful yet simple quantum algorithms is perhaps of more importance now than it may ever be in the future. In place of quantum walks, the quantum Fourier transform, and asymptotic results about far-term advantages of quantum computation, the real-world applications of …
-
Quantum RVE solver in the NISQ regime
… of microscopic boundary-value problems. Quantum algorithms based on the quantum Fourier transform (QFT) offer a potential way to reduce this scaling exponentially. Previous work formulated a quantum homogenization algorithm for a onedimensional Representative Volume Element (RVE) by …
-
Design and synthesis of efficient circuits for quantum computers
… in the field of experimental construction of quantum computers with increased fidelity components shows that large-scale machines based on the principles of quantum physics are likely to be realized in the near future. As the size of the future quantum computers will be increased, efficient …
-
Analog Control of the Diamond Quantum Processor
Diamond quantum processors, based on the nitrogen-vacancy (NV) centre, offer long coherence times and high-fidelity optical control at room temperature, making them a promising platform for quantum technologies. Until now, they have been operated almost exclusively using the gate-based digital …
Page 1 of 2