Related papers: Some Comments on Unitary Qubit Lattice Algorithms …
We propose a scheme for quantum computation in optical lattices. The qubits are encoded in the spacial wavefunction of the atoms such that spin decoherence does not influence the computation. Quantum operations are steered by shaking the…
The variational quantum eigensolver is one of the most promising algorithms for near-term quantum computers. It has the potential to solve quantum chemistry problems involving strongly correlated electrons, which are otherwise difficult to…
Lattice calculations could boost our understanding of Deep Inelastic Scattering by evaluating moments of the Nucleon Structure Functions. To this end we study the product of electromagnetic currents between quark states. The Operator…
There is considerable interest in the application of quantum information science to advance computations in plasma physics. Many of the topics in fusion plasma physics are classical in nature. In order to implement them on quantum computers…
Quantum cascade lasers (QCLs) are high-power coherent light sources in the midinfrared and terahertz parts of the electromagnetic spectrum. They are devices in which the electronic and lattice systems are far from equilibrium, strongly…
We continue our analysis of the physics of quantum lattice gas automata (QLGA). Previous work has been restricted to periodic or infinite lattices; simulation of more realistic physical situations requires finite sizes and non-periodic…
We advocate lattice methods as the tool of choice to constructively define a background-independent theory of Lorentzian quantum gravity and explore its physical properties in the Planckian regime. The formulation that arguably has most…
The quantum link~\cite{Brower:1997ha} Hamiltonian was introduced two decades ago as an alternative to Wilson's Euclidean lattice QCD with gauge fields represented by bi-linear fermion/anti-fermion operators. When generalized this new…
We suggest that a certain one-to-one parametrization of completely positive maps on the matrix algebra might be useful in the study of quantum channels. This is illustrated in the case of binary quantum channels. While the algorithm is…
Let L be a complete lattice and let Q(L) be the unital quantale of join-continuous endo-functions of L. We prove the following result: Q(L) is an involutive (that is, non-commutative cyclic $\star$-autonomous) quantale if and only if L is a…
Quantum algorithms are typically understood in terms of the evolution of a multi-qubit quantum system under a prescribed sequence of unitary transformations. The input to the algorithm prescribes some of the unitary transformations in the…
Variational quantum algorithms (VQAs) are the quantum analog of classical neural networks (NNs). A VQA consists of a parameterized quantum circuit (PQC) which is composed of multiple layers of ansatzes (simpler PQCs, which are an analogy of…
Quantum annealers are suited to solve several logistic optimization problems expressed in the QUBO formulation. However, the solutions proposed by the quantum annealers are generally not optimal, as thermal noise and other disturbing…
Variational quantum algorithms (VQAs) utilize a hybrid quantum-classical architecture to recast problems of high-dimensional linear algebra as ones of stochastic optimization. Despite the promise of leveraging near- to intermediate-term…
The ALLIANCE code is developed to solve a new set of four-dimensional electromagnetic drift-kinetic equations in slab geometry [J. Plasma Phys. 88 905880117 (2022)]. The nonlinear equations are useful for the study of magnetized plasma…
Different hybrid quantum-classical algorithms have recently been developed as a near-term way to solve linear systems of equations on quantum devices. However, the focus has so far been mostly on the methods, rather than the problems that…
We review recent progress in understanding the notion of locality in integrable quantum lattice systems. The central concept are the so-called quasilocal conserved quantities, which go beyond the standard perception of locality. Two…
Quantum computers are known to provide an exponential advantage over classical computers for the solution of linear differential equations in high-dimensional spaces. Here, we present a quantum algorithm for the solution of nonlinear…
We present a separable version of Loop Quantum Gravity (LQG) based on an inductive system of cubic lattices. We construct semi-classical states for which the LQG operators -- the flux, the area and the volume operators -- have the right…
The Variational Quantum Linear Solver (VQLS), a hybrid quantum-classical algorithm for solving linear systems, faces a practical scalability bottleneck: the Linear Combination of Unitaries (LCU) decomposition requires O(L^2) circuit…