相关论文: Quantum permutation puzzles with indistinguishable…

The quantum mechanical transition probability is symmetric. A probabilistically motivated and more general quantum logical definition of the transition probability was introduced in two preceding papers without postulating its symmetry, but…

We describe a new class of exact square integrable solutions of the Pauli and Dirac equation in rotating electromagnetic fields. Solutions obtained by putting equations in the stationary form with help of a coordinate transformation…

The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be…

We describe both quantum particles and classical particles in terms of a classical statistical ensemble, characterized by a probability distribution in phase space. By use of a wave function in phase space both can be treated in the same…

We study the puzzle graphs of hexagonal sliding puzzles of various shapes and with various numbers of holes. The puzzle graph is a combinatorial model which captures the solvability and the complexity of sequential mechanical puzzles.…

We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…

We show how classical and quantum dualities, as well as duality relations that appear only in a sector of certain theories ("emergent dualities"), can be unveiled, and systematically established. Our method relies on the use of morphisms of…

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…

We introduce a new board game based on the ancient Chinese game of Go (Weiqi, Igo, Baduk). The key difference from the original game is that players no longer alternatively play single stones on the board but instead they take turns placing…

Random walks behave very differently for classical and quantum particles. Here we unveil a ubiquitous distinctive behavior of random walks of a photon in a one-dimensional lattice in the presence of a finite number of traps, at which the…

We present a method to experimentally realize large-scale permutation-symmetric Hamiltonians for continuous-time quantum protocols such as quantum walk and adiabatic quantum computation. In particular, the method can be used to perform an…

The universal quantum computation is obtained when there exists asymmetric anisotropic exchange between electron spins in coupled semiconductor quantum dots. The asymmetric Heisenberg model can be transformed into the isotropic model…

It is shown that neither the wave picture nor the ordinary particle picture offers a satisfactory explanation of the double-slit experiment. The Physicists who have been successful in formulating theories in the Newtonian Paradigm with its…

Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm,…

We introduce a multi-coin discrete quantum random walk where the amplitude for a coin flip depends upon previous tosses. Although the corresponding classical random walk is unbiased, a bias can be introduced into the quantum walk by varying…

We develop infinitary analogues of the $N\times N\times N$ Rubik's cube. We'll be pushed to consider the possibility of transfinitely many twists and the foremost question we shall study is whether or not all infinite scrambles are…

Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme…

Is there a general theorem that tells us when we can hope for exponential speedups from quantum algorithms, and when we cannot? In this paper, we make two advances toward such a theorem, in the black-box model where most quantum algorithms…

We present a novel form of relativistic quantum mechanics and demonstrate how to solve it using a recently derived unitary perturbation theory, within partial wave analysis. The theory is tested on a relativistic problem, with two spinless,…

In the last decades, noncommutative spacetimes and their deformed relativistic symmetries have usually been studied in the context of field theory, replacing the ordinary Minkowski background with an algebra of noncommutative coordinates.…