Related papers: Some Comments on Unitary Qubit Lattice Algorithms …
Quantum algorithms for diverse problems, including search and optimization problems, require the implementation of a reflection operator over a target state. Commonly, such reflections are approximately implemented using phase estimation.…
Quantum and quantum-inspired optimisation algorithms are designed to solve problems represented in binary, quadratic and unconstrained form. Combinatorial optimisation problems are therefore often formulated as Quadratic Unconstrained…
The unitary coupled cluster (UCC) approximation is one of the more promising wave-function ans\"atze for electronic structure calculations on quantum computers via the variational quantum eigensolver algorithm. However, for large systems…
We comment on the article by West {et al.}, ``Provably Trainable Rotationally Equivariant Quantum Machine Learning'' [PRX Quantum , 030320 (2024)]. While the general framework is insightful, we identify a key inconsistency in the…
We study waves on infinite one-dimensional lattices of particles that each interact with all others through power-law forces $F \sim r^{-\beta}$. The inverse-cube case corresponds to Calogero-Moser systems, which are well known to be…
In this overview paper, we show existence of smooth solitary-wave solutions to the nonlinear, dispersive evolution equations of the form \begin{equation*} \partial_t u + \partial_x(\Lambda^s u + u\Lambda^r u^2) = 0, \end{equation*} where…
A representation theory of the quantized Poincar\'e ($\kappa$-Poincar\'e) algebra (QPA) is developed. We show that the representations of this algebra are closely connected with the representations of the non-deformed Poincar\'e algebra. A…
The purpose of this review is to revisit recent results in the literature where quantum plasmas with arbitrary degeneracy degree are considered. This is different from a frequent approach, where completely degeneracy is assumed in dense…
Quantum computing holds great potential for solving socially relevant and computationally complex problems. Furthermore, quantum machine learning (QML) promises to rapidly improve our current machine learning capabilities. However, current…
The operator algebras of a new family of relativistic geometric models of the relativistic oscillator are studied. It is shown that, generally, the operator of number of quanta and the pair of the shift operators of each model are the…
We present a quantum algorithm for simulating the wave equation under Dirichlet and Neumann boundary conditions. The algorithm uses Hamiltonian simulation and quantum linear system algorithms as subroutines. It relies on factorizations of…
We consider a wireless network scenario applicable to metropolitan areas with developed public transport networks and high commute demands, where the mobile user equipments (UEs) move along fixed and predetermined trajectories and request…
We consider the renormalisation of lattice QCD operators with one and two covariant derivatives related to the first and second moments of generalised parton distributions and meson distribution amplitudes. Employing the clover fermion…
Classical planar vertex models afford transfer matrices with real and positive entries, which makes this class of models suitable for quantum simulations. In this work, we support this statement by building explicit quantum circuits that…
The use of operator methods of algebraic nature is shown to be a very powerful tool to deal with different forms of relativistic wave equations. The methods provide either exact or approximate solutions for various forms of differential…
We derive an intuitive and novel method to represent nodes in a graph with special unitary operators, or quantum operators, which does not require parameter training and is competitive with classical methods on scoring similarity between…
We classify nonultralocal Poisson brackets for 1-dimensional lattice systems and describe the corresponding regularizations of the Poisson bracket relations for the monodromy matrix . A nonultralocal quantum algebras on the lattices for…
A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, in this paper we begin an investigation of exactly unitary cellular automata. After proving that there can be…
The exchange graph of a 2-acyclic quiver is the graph of mutation-equivalent quivers whose edges correspond to mutations. When the quiver admits a nondegenerate Jacobi-finite potential, the exchange graph admits a natural acyclic…
A discrete-time quantum walk (QW) is essentially a unitary operator driving the evolution of a single particle on the lattice. Some QWs have familiar physics PDEs as their continuum limit. Some slight generalization of them (allowing for…