Related papers: Type-II Quantum Algorithms
This study introduces a framework for learning a low-depth surrogate quantum circuit (SQC) that approximates the nonlinear, dissipative, and hence non-unitary Bhatnagar-Gross-Krook (BGK) collision operator in the lattice Boltzmann method…
Quantum computational chemistry holds great promise for simulating molecular systems more efficiently than classical methods by leveraging quantum bits to represent molecular wavefunctions. However, current implementations face significant…
Certain aspects of some unitary quantum systems are well-described by evolution via a non-Hermitian effective Hamiltonian, as in the Wigner-Weisskopf theory for spontaneous decay. Conversely, any non-Hermitian Hamiltonian evolution can be…
There are 13 equivalence classes of 2D second order quantum and classical superintegrable systems with nontrivial potential, each associated with a quadratic algebra of hidden symmetries. We study the finite and infinite irreducible…
This paper serves as a bridge between quantum computing and analogical modeling (a general theory for predicting categories of behavior in varying contexts). Since its formulation in the early 1980s, analogical modeling has been…
Supersymmetric models are grounded in the intriguing concept of a hypothetical symmetry that relates bosonic and fermionic particles. This symmetry has profound implications, offering valuable extensions to the Standard Model of particle…
We introduce an intermediate quantum computing model built from translation-invariant Ising-interacting spins. Despite being non-universal, the model cannot be classically efficiently simulated unless the polynomial hierarchy collapses.…
Bosonic quantum conversion systems can be modeled by many-particle single-mode Hamiltonians describing a conversion of $n$ molecules of type A into $m$ molecules of type B and vice versa. These Hamiltonians are analyzed in terms of…
Rapid progress in noisy intermediate-scale quantum (NISQ) computing technology has led to the development of novel resource-efficient hybrid quantum-classical algorithms, such as the variational quantum eigensolver (VQE), that can address…
Quantum neural networks represent a new machine learning paradigm that has recently attracted much attention due to its potential promise. Under certain conditions, these models approximate the distribution of their dataset with a truncated…
We present the general ideas on SuperSymmetric Quantum Mechanics (SUSY-QM) using different representations for the operators in question, which are defined by the corresponding bosonic Hamiltonian as part of SUSY Hamiltonian and its…
The advent of hybrid computing platforms consisting of quantum processing units integrated with conventional high-performance computing brings new opportunities for algorithm design. By strategically offloading select portions of the…
Improving the efficiency and accuracy of energy calculations has been of significant and continued interest in the area of materials informatics, a field that applies machine learning techniques to computational materials data. Here, we…
Quantum Boltzmann machines are natural quantum generalizations of Boltzmann machines that are expected to be more expressive than their classical counterparts, as evidenced both numerically for small systems and asymptotically under various…
The Heisenberg representation of quantum operators provides a powerful technique for reasoning about quantum circuits, albeit those restricted to the common (non-universal) Clifford set H, S and CNOT. The Gottesman-Knill theorem showed that…
We propose in this work a concept of integrability for quantum systems, which corresponds to the concept of noncommutative integrability for systems in classical mechanics. We determine a condition for quantum operators which can be a…
Complex quantum simulation workflows are often hindered by incompatible wavefunction representations adopted across different algorithmic frameworks. In particular, the mismatch between the first- and second-quantization formalisms prevents…
A quantum simulator is a device engineered to reproduce the properties of an ideal quantum model. It allows the study of quantum systems that cannot be efficiently simulated on classical computers. While a universal quantum computer is also…
In Part I of this series we presented the general ideas of applying group-algebraic methods for describing quantum systems. The treatment was there very "ascetic" in that only the structure of a locally compact topological group was used.…
Bayesian learning is ubiquitous for implementing classification and regression tasks, however, it is accompanied by computationally intractable limitations when the feature spaces become extremely large. Aiming to solve this problem, we…