Related papers: Symmetric and anti-symmetric quantum functions
We find examples of duality among quantum theories that are related to arithmetic functions by identifying distinct Hamiltonians that have identical partition functions at suitably related coupling constants or temperatures. We are led to…
We define two-parameter families of noncommutative symmetric functions and quasi-symmetric functions, which appear to be the proper analogues of the Macdonald symmetric functions in these settings.
Qubits are a great way to build a quantum computer, but a limited way to program one. We replace the usual "states and gates" formalism with a "props and ops" (propositions and operators) model in which (a) the C*-algebra of observables…
The query model (or black-box model) has attracted much attention from the communities of both classical and quantum computing. Usually, quantum advantages are revealed by presenting a quantum algorithm that has a better query complexity…
In this thesis we study symmetric structures in Hilbert spaces known as symmetric informationally complete positive operator-valued measures (SIC-POVMs), mutually unbiased bases (MUBs), and MUB-balanced states. Our tools include symmetries…
The main features of quantum computing are described in the framework of spin resonance methods. Stress is put on the fact that quantum computing is in itself nothing but a re-interpretation (fruitful indeed) of well-known concepts. The…
It is presently shown that the Deutsch-Jozsa algorithm is connected to the concept of bent function. Particularly, it is noticeable that the quantum circuit used to denote the well known quantum algorithm is by itself the quantum computer…
We prove that the vast majority of symmetric states of qubits can be decomposed in a unique way into a superposition of spin 1/2 coherent states. For the case of two qubits, the proposed decomposition reproduces the Schmidt decomposition…
The unitary group acting on the Hilbert space of three quantum bits admits a Lie subgroup, of elements which permute with the symmetric group of permutations. Under the action of such Lie subgroup, the Hilbert space splits into three…
The Deutsch-Jozsa algorithm distinguishes constant functions from balanced functions with a single evaluation. In the first part of this work, we present simulations of the nuclear magnetic resonance (NMR) application of the Deutsch-Jozsa…
The aim of the present paper is twofold. First, to give the main ideas behind quantum computingand quantum information, a field based on quantum-mechanical phenomena. Therefore, a shortreview is devoted to (i) quantum bits or qubits (and…
We define two finite q-analogs of certain multiple harmonic series with an arbitrary number of free parameters, and prove identities for these q-analogs, expressing them in terms of multiply nested sums involving the Gaussian binomial…
Links between supersymmetric classical and quantum mechanics are explored. Diagrammatic representations for \hbar-expansions of norms of ground states are provided. The WKB spectra of supersymmetric non harmonic oscillators are found.
Early in 1992, Deutsch-Jozsa algorithm computed a symmetric partial Boolean function with a single quantum query, and thus achieved the best separation between classical deterministic and exact quantum query complexity. Until recent years,…
We define and study symmetrized and antisymmetrized multivariate exponential functions. They are defined as determinants and antideterminants of matrices whose entries are exponential functions of one variable. These functions are…
A symmetric function of $N$ variables can be given in terms of symmetric polynomials of these variables. We determine those symmetric polynomials in which the dual differential operators take the neatest form when expressed in terms of our…
We introduce new families of cylindric symmetric functions as subcoalgebras in the ring of symmetric functions $\Lambda$ (viewed as a Hopf algebra) which have non-negative structure constants. Combinatorially these cylindric symmetric…
This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…
In this paper, we propose the concept of symplectic computers, which have the potential to be more powerful than quantum computers. Unlike quantum computing, which consists of a sequence of unitary transformations (gates) and projectors…
Due to the exponential increase of the numerical effort with the number of degrees of freedom, moving basis functions have a long history in quantum dynamics. In addition, spawning of new basis functions is routinely applied. Here we…