Related papers: Quantum algorithm for universal implementation of …
Topological quantum computing has recently proven itself to be a powerful computational model when constructing viable architectures for large scale computation. The topological model is constructed from the foundation of a error correction…
Recent advances in quantum computing devices have brought attention to hybrid quantum-classical algorithms like the Variational Quantum Eigensolver (VQE) as a potential route to practical quantum advantage in chemistry. However, it is not…
Quantifying quantum entanglement is a pivotal challenge in quantum information science, particularly for high-dimensional systems, due to its computational complexity. This thesis extends the geometric measure of entanglement (GME) to…
Many researchers have been heavily investigated on quantum phase estimation (QPE) algorithms to find the unknown phase, since QPE is the core building block of the most quantum algorithms such as the Shor's factoring algorithm, quantum…
Partial differential equations (PDEs) are central to computational electromagnetics (CEM) and photonic design, but classical solvers face high costs for large or complex structures. Quantum Hamiltonian simulation provides a framework to…
Realisation of experiments even on small and medium-scale quantum computers requires an optimisation of several parameters to achieve high-fidelity operations. As the size of the quantum register increases, the characterisation of quantum…
A hybrid quantum-classical algorithm is a computational scheme in which quantum circuits are used to extract information that is then processed by a classical routine to guide subsequent quantum operations. These algorithms are especially…
We propose a quantum algorithm to compute low-energy expectation values of a quantum Hamiltonian by sampling a partition function associated with the average energy of that Hamiltonian. For any given quantum circuit-Hamiltonian pair, there…
At large scales, quantum systems may become advantageous over their classical counterparts at performing certain tasks. Developing tools to analyse these systems at the relevant scales, in a manner consistent with quantum mechanics, is…
We propose a quantum algorithm for finding eigenvalues of non-unitary matrices. We show how to construct, through interactions in a quantum system and projective measurements, a non-Hermitian or non-unitary matrix and obtain its eigenvalues…
Identifying the Hamiltonian of a quantum system from experimental data is considered. General limits on the identifiability of model parameters with limited experimental resources are investigated, and a specific Bayesian estimation…
Estimating the eigenvalues of a unitary transformation U by standard phase estimation requires the implementation of controlled-U-gates which are not available if U is only given as a black box. We show that a simple trick allows to measure…
Quantum optimization algorithms offer a promising route to finding the ground states of target Hamiltonians on near-term quantum devices. None the less, it remains necessary to limit the evolution time and circuit depth as much as possible,…
Under suitable assumptions, the quantum phase estimation (QPE) algorithm is able to achieve Heisenberg-limited precision scaling in estimating the ground state energy. However, QPE requires a large number of ancilla qubits and large circuit…
A genuine feature of projective quantum measurements is that they inevitably alter the mean energy of the observed system if the measured quantity does not commute with the Hamiltonian. Compared to the classical case, Jacobs proved that…
We present a quantum algorithm to estimate parameters at the quantum metrology limit using deterministic quantum computation with one bit. When the interactions occurring in a quantum system are described by a Hamiltonian $H= \theta H_0$,…
Characterization of qubit couplings in many-body quantum systems is essential for benchmarking quantum computation and simulation. We propose a tomographic measurement scheme to determine all the coupling terms in a general many-body…
Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However, the lack of computationally efficient…
Quantum computing can provide speedups in solving many problems as the evolution of a quantum system is described by a unitary operator in an exponentially large Hilbert space. Such unitary operators change the phase of their eigenstates…
Quantum phase estimation (QPE) is a cornerstone algorithm for extracting Hamiltonian eigenvalues, but its standard, eigenstate-centric form relies on carefully prepared coherent inputs that are costly or impractical for many strongly…