Related papers: Subspace methods for electronic structure simulati…
Quantum computing has emerged as a promising platform for simulating strongly correlated systems in chemistry, for which the standard quantum chemistry methods are either qualitatively inaccurate or too expensive. However, due to the…
Modeling electronic systems is an important application for quantum computers. In the context of materials science, an important open problem is the computational description of chemical reactions on surfaces. In this work, we outline a…
Quantum computation appears to offer significant advantages over classical computation and this has generated a tremendous interest in the field. In this thesis we consider the application of quantum computers to scientific computing and…
Quantum SENiority-based Subspace Expansion (Q-SENSE) is a hybrid quantum-classical algorithm that interpolates between the Variational Quantum Eigensolver (VQE) and Configuration Interaction (CI) methods. It constructs Hamiltonian matrix…
Quantum computing uses the physical principles of very small systems to develop computing platforms which can solve problems that are intractable on conventional supercomputers. There are challenges not only in building the required…
Quantum machine learning could possibly become a valuable alternative to classical machine learning for applications in High Energy Physics by offering computational speed-ups. In this study, we employ a support vector machine with a…
Due to the wide range of technical applications of actinide elements, a thorough understanding of their electronic structure could complement technological improvements in many different areas. Quantum computing could greatly aid in this…
Quantum computers have the potential to transform the ways in which we tackle some important problems. The efforts by companies like Google, IBM and Microsoft to construct quantum computers have been making headlines for years. Equally…
A construction is given for simulating any deterministic finite state machine (FSM) on a quantum computer in a space-efficient manner. By constructing a superposition of input strings of lengths K or less, questions can be asked about the…
The procedure for simulating the nuclear magnetic resonance spectrum linked to the spin system of a molecule for a certain nucleus entails diagonalizing the associated Hamiltonian matrix. As the dimensions of said matrix grow exponentially…
Simulating quantum systems is one of the most promising tasks where quantum computing can potentially outperform classical computing. However, the robustness needed for reliable simulations of medium to large systems is beyond the reach of…
In the Hamiltonian formulation, Quantum Field Theory calculations scale exponentially with spatial volume, making real-time simulations intractable on classical computers and motivating quantum computation approaches. In Hamiltonian…
Quantum computers promise to revolutionise electronic simulations by overcoming the exponential scaling of many-electron problems. While electronic wave functions can be represented using a product of fermionic unitary operators, shallow…
The accurate computation of ground and excited states of many-fermion quantum systems is one of the most consequential, contemporary challenges in the physical and computational sciences whose solution stands to benefit significantly from…
Quantum computers hold immense potential in the field of chemistry, ushering new frontiers to solve complex many body problems that are beyond the reach of classical computers. However, noise in the current quantum hardware limits their…
Recent technological advances may lead to the development of small scale quantum computers capable of solving problems that cannot be tackled with classical computers. A limited number of algorithms has been proposed and their relevance to…
The development of quantum control methods is an essential task for emerging quantum technologies. In general, the process of optimizing quantum controls scales very unfavorably in system size due to the exponential growth of the Hilbert…
Quantum subspace diagonalization methods are an exciting new class of algorithms for solving large\rev{-}scale eigenvalue problems using quantum computers. Unfortunately, these methods require the solution of an ill-conditioned generalized…
We review the theoretical aspects of pseudospin quantum computation using vertically coupled quantum dots in the quantum Hall regime. We discuss the robustness and addressability of these collective, charge-based qubits. The low energy…
This paper describes an algorithmic system called SQT for the computer simulation of a wide class of quantum experiments on entangled particles. SQT maintains a hidden internal state for each particle and it provides an initialization…