相关论文: Quantum permutation puzzles with indistinguishable…
Let $G$ be a semisimple Lie group, ${\frak g}$ its Lie algebra. For any symmetric space $M$ over $G$ we construct a new (deformed) multiplication in the space $A$ of smooth functions on $M$. This multiplication is invariant under the action…
The quantum analogue of the equality function, known as the quantum state identity problem, is the task of deciding whether $n$ unknown quantum states are equal or unequal, given the promise that all states are either pairwise orthogonal or…
Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by having it follow from…
We propose a new kind of sliding-block puzzle, called Gourds, where the objective is to rearrange 1 x 2 pieces on a hexagonal grid board of 2n + 1 cells with n pieces, using sliding, turning and pivoting moves. This puzzle has a single…
Some notes about quantum physics, an interpretation if one wishes, are put forward, insisting on `closely following the mathematics/formalism, the `nuts and bolts of what quantum physics says'. These, basically well-known, issues seem to…
Complete sets of commutation relations for arbitrary pairs of quantum minors are computed, with explicit coefficients in closed form.
We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…
We introduce a mutation algorithm for puzzles that is a three-direction analogue of the classical jeu de taquin algorithm for semistandard tableaux. We apply this algorithm to prove our conjectured puzzle formula for the equivariant…
We show that a simple eavesdropper listening in on classical communication between potentially entangled quantum parties will eventually be able to impersonate any of the parties. Furthermore, the attack is efficient if one-way puzzles do…
We derive new solutions of the Schr\"odinger equation which describe the motion of particles in the Penning trap. These solutions are direct counterparts of classical orbits. They are obtained by injection of classical trajectories into the…
In this lecture I will talk about three mathematical puzzles involving mathematics and computation that have preoccupied me over the years. The first puzzle is to understand the amazing success of the simplex algorithm for linear…
This paper extends the quantum search class of algorithms to the multiple solution case. It is shown that, like the basic search algorithm, these too can be represented as a rotation in an appropriately defined two dimensional vector space.…
Any physical transformation that equally distributes quantum information over a large number M of users can be approximated by a classical broadcasting of measurement outcomes. The accuracy of the approximation is at least of the order 1/M.…
The existence of indistinguishable quantum particles provides an explanation for various physical phenomena we observe in nature. We lay out a path for the study of indistinguishable particles in general probabilistic theories (GPTs) via…
Merging disciplines has led to incredible learnings and breakthroughs throughout history, including the discovery of quantum computing: a cross between computation and quantum physics. In this paper, I will discuss how we can cross quantum…
In 1926, Dirac stated that quantum mechanics can be obtained from classical theory through a change in the only rule. In his view, classical mechanics is formulated through commutative quantities (c-numbers) while quantum mechanics requires…
Let $S_n$ be the symmetric group of all permutations of $\{1, \cdots, n\}$ with two generators: the transposition switching $1$ with $2$ and the cyclic permutation sending $k$ to $k+1$ for $1\leq k\leq n-1$ and $n$ to $1$ (denoted by…
It is commonly stated that decoherence in open quantum systems is due to growing entanglement with an environment. In practice, however, surprisingly often decoherence may equally well be described by random unitary dynamics without…
In this paper, first we explain what are the `quantum displacements'. We establish a group of bases, which contains the coupled bases coupling a ququart and a bipartite qubit systems. By these bases, we can realize the quantum…
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…