Related papers: Plethysm is in #BQP
We give a formula for the number of irreducibles (with multiplicity) in the decomposition of the plethysm $s_\lambda[s_m]$ of Schur functions in terms of the number of lattice points in certain rational polytopes. In the case where $\lambda…
We explore the computational implications of a superposition of spacetimes, a phenomenon hypothesized in quantum gravity theories. This was initiated by Shmueli (2024) where the author introduced the complexity class $\mathbf{BQP^{OI}}$…
Quantum algorithms for classical physics problems expose new patterns of quantum information flow as compared to the many-body Schr\"{o}dinger equation. As a result, besides their potential practical applications, they also offer a valuable…
Polyadic systems and their representations are reviewed and a classification of general polyadic systems is presented. A new multiplace generalization of associativity preserving homomorphisms, a 'heteromorphism' which connects polyadic…
The "quantum complexity" of a unitary operator measures the difficulty of its construction from a set of elementary quantum gates. While the notion of quantum complexity was first introduced as a quantum generalization of the classical…
A fast and efficient numerical-analytical approach is proposed for modeling complex behaviour in the BBGKY hierarchy of kinetic equations. We construct the multiscale representation for hierarchy of reduced distribution functions in the…
We explain why, in a configuration space that is multiply connected, i.e., whose fundamental group is nontrivial, there are several quantum theories, corresponding to different choices of topological factors. We do this in the context of…
We investigate the equivalence of bipartite quantum mixed states under local unitary transformations by introducing representation classes from a geometrical approach. It is shown that two bipartite mixed states are equivalent under local…
The interplay between supersymmetry and classical and quantum computation is discussed. First, it is shown that the problem of computing the Witten index of $\mathcal N \leq 2$ quantum mechanical systems is $\#P$-complete and therefore…
We sketch and emphasize the automatic emergence of a quantum potential Q in e.g. classical WDW type equations upon inserting a (Bohmian) complex wave function. The interpretation of Q in terms of momentum fluctuations via Fisher information…
In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters. Taking this one step further, we consider a model of computation that disregards even the topology of the particle…
It is shown for classical and quantum ensembles that there is a unique quantity which has the properties of a "volume". This quantity is a function of the ensemble entropy, and hence provides a geometric interpretation for the latter. It…
Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomial-time computations. This paper expands his framework to a…
We study the computational complexity of the Guided Local Hamiltonian problem: given a local Hamiltonian $H$ together with a classical description of a guiding state that has non-negligible overlap with the ground state of $H$, estimate the…
We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers, which may be seen as variants of CSPs in the mould of quantified CSPs (QCSPs). We show that a single counting quantifier strictly…
The Fourier transform, known in classical analysis, and generalized in abstract harmonic analysis, can also be considered in the theory of locally compact quantum groups. In this note, I discuss some aspects of this more general Fourier…
This work introduces a rigorous notion of localization probability of a quantum state within a given subspace of its Hilbert space. A non-negative operator A is uniquely decomposed as A=B+C, where B is the maximal positive operator…
The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are…
From the existence of an efficient quantum algorithm for factoring, it is likely that quantum computation is intrinsically more powerful than classical computation. At present, the best upper bound known for the power of quantum computation…
We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate these circuits classically…