Related papers: A Matrix Big Bang on a Quantum Computer
Distributed-memory matrix multiplication (MM) is a key element of algorithms in many domains (machine learning, quantum physics). Conventional algorithms for dense MM rely on regular/uniform data decomposition to ensure load balance. These…
Quantum computers take advantage of interfering quantum alternatives in order to handle problems that might be too time consuming with algorithms based on classical logic. Developing quantum computers requires new ways of thinking beyond…
Quantum Chemistry and Physics have been pinpointed as killer applications for quantum computers, and quantum algorithms have been designed to solve the Schr\"odinger equation with the wavefunction formalism. It is yet limited to small…
We ask how quantum theory compares to more general physical theories from the point of view of dimension. To do so, we first give two model independent definition of the dimension of physical systems, based on measurements and on the…
Quantum computation and quantum information are of great current interest in computer science, mathematics, physical sciences and engineering. They will likely lead to a new wave of technological innovations in communication, computation…
Perturbation theory (PT) might be one of the most powerful and fruitful tools for both physicists and chemists, which evoked an explosion of applications with the blooming of atomic and subatomic physics. Even though PT is well-used today,…
In classical theory, the physical systems are elucidated through the concepts of particles and waves, which aim to describe the reality of the physical system with certainty. In this framework, particles are mathematically represented by…
The perturbative treatment of realistic quantum field theories, such as quantum electrodynamics, requires the use of mathematical idealizations in the approximation series for scattering amplitudes. Such mathematical idealisations are…
We review an approach towards a covariant formulation of Matrix theory based on a discretization of the 11d membrane. Higher dimensional algebraic structures, such as the quantum triple Nambu bracket, naturally appear in this approach. We…
We investigate the compression of quantum information with respect to a given set $\mathcal{M}$ of high-dimensional measurements. This leads to a notion of simulability, where we demand that the statistics obtained from $\mathcal{M}$ and an…
We explain the concepts of computational statistical physics which have proven very helpful in the study of Yang-Mills integrals, an ubiquitous new class of matrix models. Issues treated are: Absolute convergence versus Monte Carlo…
High-energy particle collisions can convert energy into matter through the inelastic production of new particles. Quantum computers are an ideal platform for simulating the out-of-equilibrium dynamics of collisions and the formation of…
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
Quantum complexity is emerging as a key property of many-body systems, including black holes, topological materials, and early quantum computers. A state's complexity quantifies the number of computational gates required to prepare the…
Quantum computing comes with the potential to push computational boundaries in various domains including, e.g., cryptography, simulation, optimization, and machine learning. Exploiting the principles of quantum mechanics, new algorithms can…
We study singular 1/2 BPS solutions in M-theory using 11-dimensional superstar solutions. The superstar solutions and their corresponding plane wave limits could give an insight how one may deform the boundary conditions to get singular,…
Determining the steady state of an open quantum system is crucial for characterizing quantum devices and studying various physical phenomena. Often, computing a single steady state is insufficient, and it is necessary to explore its…
Solving quantum many-body systems is one of the most significant regimes where quantum computing applies. Currently, as a hardware-friendly computational paradigms, variational algorithms are often used for finding the ground energy of…
It has been proposed recently that, in the framework of M(atrix) theory, N=8 supersymmetric U(N) Yang-Mills theory in 1+1 dimensions gives rise to type IIA long string configurations. We point out that the quantum moduli space of…
Classical machine learning theory and theory of quantum computations are among of the most rapidly developing scientific areas in our days. In recent years, researchers investigated if quantum computing can help to improve classical machine…