Related papers: Remark on Quantum Nambu Bracket
Classical solutions of membrane equations that were recently identified as limits of matrix-solutions are looked upon from another angle
Matrix permanents arise naturally in the context of linear optical networks fed with nonclassical states of light. In this letter we tie the computational complexity of a class of multi-dimensional integrals to the permanents of large…
The dynamics of even topological open membranes relies on Nambu Brackets. Consequently, such 2p-branes can be quantized through the consistent quantization of the underlying Nambu dynamical structures. This is a summary construction relying…
We associate a half-integer number, called {\em the quantum index}, to algebraic curves in the real plane satisfying to certain conditions. The area encompassed by the logarithmic image of such curves is equal to $\pi^2$ times the quantum…
We discuss existence of mixed state of multicomponent system with given spectrum and given reduced density matrices. We give a complete solution of the problem in terms of linear inequalities on the spectra, accompanied with extensive…
We study some aspects of the Quantum Brachistochrone Problem. Physical realizability of the faster pseudo Hermitian version of the problem is also discussed. This analysis, applied to simple quantum gates, supports an informational…
We propose a complete quantum-classical hybrid branch-and-bound algorithm (QCBB) to solve binary linear programs with equality constraints. That includes bound calculation, convergence metrics and optimality guarantee to the quantum…
We introduce an explicit construction for realizing of the space of invariant deformation quantizations on an arbitrary symmetric bounded domain.
Phase Space is the framework best suited for quantizing superintegrable systems--systems with more conserved quantities than degrees of freedom. In this quantization method, the symmetry algebras of the hamiltonian invariants are preserved…
A new quantum architecture for multiplying signed integers is presented based on Booth's algorithm, which is well known in classical computation. It is shown how a quantum binary chain might be encoded by its flank changes, giving the final…
The rigidity of a matrix measures how many of its entries need to be changed in order to reduce its rank to some value. Good lower bounds on the rigidity of an explicit matrix would imply good lower bounds for arithmetic circuits as well as…
For a minimal affinization over a quantum loop algebra of type BC, we provide a character formula in terms of Demazure operators and multiplicities in terms of crystal bases. We also provide a simple formula for the limit of characters.…
We show how to express the information contained in a Quantum Bayesian (QB) net as a product of unitary matrices. If each of these unitary matrices is expressed as a sequence of elementary operations (operations such as controlled-nots and…
The recently introduced quantum antibracket is further generalized allowing for the defining odd operator Q to be arbitrary. We give exact formulas for higher quantum antibrackets of arbitrary orders and their generalized Jacobi identities.…
This paper offers an adaptation to the convenient setting of finite dimensional Nambu-Poisson structures. In particular, for partial Nambu structures, we look for those whose classical geometrical results in finite dimension can be extended…
We give a new quantum circuit approximation of quantum multiplexors based on the idea of complexity theory oracles. As an added bonus, our multiplexor approximation immediately gives a quantum circuit approximation of diagonal unitary…
Starting from deformation quantization (star-products), the quantization problem of Nambu Mechanics is investigated. After considering some impossibilities and pushing some analogies with field quantization, a solution to the quantization…
Recent studies on quantum computing algorithms focus on excavating features of quantum computers which have potential for contributing to computational model enhancements. Among various approaches, quantum annealing methods effectively…
Within the framework of Quantum Reduced Loop Gravity we quantize the Hamiltonian for a gauge vector field. The regularization can be performed using tools analogous to the ones adopted in full Loop Quantum Gravity, while the matrix elements…
In this paper, we develop a way to encode several NP-Complete problems in Abstract Argumentation to Quadratic Unconstrained Binary Optimization (QUBO) problems. In this form, a solution for a QUBO problem involves minimizing a quadratic…