Related papers: Quantum paving: When sphere packings meet Gabor fr…
Quantum computing is gaining increased attention as a potential way to speed up simulations of physical systems, and it is also of interest to apply it to simulations of classical plasmas. However, quantum information science is…
We reformulate the covering and quantizer problems as the determination of the ground states of interacting particles in $\mathbb{R}^d$ that generally involve single-body, two-body, three-body, and higher-body interactions. This is done by…
The purpose of this paper is to explore the applications of quantum computing to energy systems optimization problems and discuss some of the challenges faced by quantum computers with techniques to overcome them. The basic concepts…
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 computers hold great promise, but it remains a challenge to find efficient quantum circuits that solve interesting computational problems. We show that finding optimal quantum circuits is essentially equivalent to finding the…
A large spectrum of problems in classical physics and engineering, such as turbulence, is governed by nonlinear differential equations, which typically require high-performance computing to be solved. Over the past decade, however, the…
Current quantum computing devices have different strengths and weaknesses depending on their architectures. This means that flexible approaches to circuit design are necessary. We address this task by introducing a novel space-efficient…
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…
We introduce parity quantum optimization with the aim of solving optimization problems consisting of arbitrary $k$-body interactions and side conditions using planar quantum chip architectures. The method introduces a decomposition of the…
Quantum computing is a new computational paradigm with the potential to solve certain computationally challenging problems much faster than traditional approaches. Civil engineering encompasses many computationally challenging problems,…
Critical decision-making issues in science, engineering, and industry are based on combinatorial optimization; however, its application is inherently limited by the NP-hard nature of the problem. A specialized paradigm of analogue quantum…
Quantum computing and cloud computing are two giants for futuristic computing. Both technologies complement each other. Quantum clouds, therefore, is deploying the resources of quantum computation in a cloud environment to provide solution…
Nuclear physics, whose underling theory is described by quantum gauge field coupled with matter, is fundamentally important and yet is formidably challenge for simulation with classical computers. Quantum computing provides a perhaps…
Quantum computing devices are believed to be powerful in solving hard computational tasks, in particular, combinatorial optimization problems. In the present work, we consider a particular type of the minimum bin packing problem, which can…
The notion of quantum embedding is considered for two classes of examples: quantum coadjoint orbits in Lie coalgebras and quantum symplectic leaves in spaces with non-Lie permutation relations. A method for constructing irreducible…
Computational methods are the most effective tools we have besides scientific experiments to explore the properties of complex biological systems. Progress is slowing because digital silicon computers have reached their limits in terms of…
We review here the recent success in quantum annealing, i.e., optimization of the cost or energy functions of complex systems utilizing quantum fluctuations. The concept is introduced in successive steps through the studies of mapping of…
Quantum annealing leverages the properties of interacting quantum spin systems to solve computational problems, typically optimisation problems. Current hardware now has capabilities that can be used to solve condensed matter physics…
Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization…
Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same…