Related papers: Generalized Quantum Turing Machine and its Applica…
This is the first in a series of papers on an attempt to understand quantum field theory mathematically. In this paper we shall introduce and study BV QFT algebra and BV QFT as the proto-algebraic model of quantum field theory by exploiting…
Simon's problem is an essential example demonstrating the faster speed of quantum computers than classical computers for solving some problems. The optimal separation between exact quantum and classical query complexities for Simon's…
The aim of this work is to show a brand-new way of making deterministic Quantum Computing (short QC), in the sense of Theory of Calculability, by meaning of unitary evolution. We start from the original Shor's Algorithm to explain how the…
Out-of-time-order correlators (OTOCs) are a standard measure of quantum chaos. Of the four operators involved, one pair may be regarded as a source and the other as a probe. A usual approach, applicable to large-$N$ systems such as the SYK…
Dedicated treatment of symmetries in satisfiability problems (SAT) is indispensable for solving various classes of instances arising in practice. However, the exploitation of symmetries usually takes a black box approach. Typically,…
We extend the second-order von Neumann approach within the generalized master equation formalism for quantum electronic transport to include the counting field. The resulting non-Markovian evolution equation for the reduced density matrix…
Quantum circuit synthesis is the task of decomposing a given quantum operator into a sequence of elementary quantum gates. Since the finite target gate set cannot exactly implement any given operator, approximation is often necessary. Model…
This Ph.D. thesis provides a comprehensive review of the state-of-the-art in the field of Variational Quantum Algorithms and Quantum Machine Learning, including numerous original contributions. The first chapters are devoted to a brief…
The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables,…
Quantum computing is poised to transform computational paradigms across science and industry. As the field evolves, it can benefit from established classical methodologies, including promising paradigms such as Transfer of Knowledge (ToK).…
The generalized eigenvalue (GE) problems are of particular importance in various areas of science engineering and machine learning. We present a variational quantum algorithm for finding the desired generalized eigenvalue of the GE problem,…
Quantum signal processing (QSP) provides a systematic framework for implementing a polynomial transformation of a linear operator, and unifies nearly all known quantum algorithms. In parallel, recent works have developed randomized…
We generalise the $\eta$ regularisation scheme in order to develop a framework for systematically studying regularisation of loops in quantum field theory. This allows us to "solve" a set of gauge consistency conditions for families of…
I investigate a new idea of perturbation theory in covariant canonical quantization. I present preliminary results for a toy model of a harmonic oscillator with a quartic perturbation, and show that this method reproduces the quantized…
In the chaotic quantization approach one replaces the Gaussian white noise of the Parisi-Wu approach of stochastic quantization by a deterministic chaotic process on a very small scale. We consider suitable coupled chaotic noise processes…
We analyze the use of the Solovay Kitaev (SK) algorithm to generate an ensemble of one qubit rotations over which to perform randomized compilation. We perform simulations to compare the trace distance between the quantum state resulting…
There are major advantages in a newer version of Grover's quantum algorithm utilizing a general unitary transformation in the search of a single object in a large unsorted database. In this paper, we generalize this algorithm to multiobject…
Quantum Hamiltonian identification is important for characterizing the dynamics of quantum systems, calibrating quantum devices and achieving precise quantum control. In this paper, an effective two-step optimization (TSO) quantum…
Noisy intermediate-scale quantum computers (NISQ computers) are now readily available, motivating many researchers to experiment with Variational Quantum Algorithms (VQAs). Among them, the Quantum Approximate Optimization Algorithm (QAOA)…
Certain quantum topological invariants of three manifolds can be written in the form of the Gaussian sum. It is shown that such topological invariants can be approximated efficiently by a quantum computer. The invariants discussed here are…