相关论文: Quantum permutation puzzles with indistinguishable…
An interference experiment with entangled particles is theoretically analyzed, where one of the entangled pair (particle 1) goes through a multi-slit before being detected at a fixed detector. In addition, one introduces a mechanism for…
Consider a fixed universe of $N=2^n$ elements and the uniform distribution over elements of some subset of size $K$. Given samples from this distribution, the task of complement sampling is to provide a sample from the complementary subset.…
In quantum theory, particles in three spatial dimensions come in two different types: bosons or fermions, which exhibit sharply contrasting behaviours due to their different exchange statistics. Could more general forms of probabilistic…
The suggestion that particles of the same kind may be indistinguishable in a fundamental sense, even so that challenges to traditional notions of individuality and identity may arise, has first come up in the context of classical…
We give an elementary introduction to the notion of quantum entanglement between distinguishable parties and review a recent proposal about solid state quantum computation with spin-qubits in quantum dots. The indistinguishable character of…
Classical systems can be entangled. Entanglement is defined by coincidence correlations. Quantum entanglement experiments can be mimicked by a mechanical system with a single conserved variable and 77.8% conditional efficiency. Experiments…
Consider a periodical (in two independent directions) tiling of the plane with polygons (faces). In this article we shall only give examples using squares, regular hexagons, equilateral triangles and parallelograms ("unions" of two…
Recent improvements in control of quantum systems make it seem feasible to finally build a quantum computer within a decade. While it has been shown that such a quantum computer can in principle solve certain small electronic structure…
We introduce a formulation of quantum theory (QT) as a general probabilistic theory but expressed via quasi-expectation operators (QEOs). This formulation provides a direct interpretation of density matrices as quasi-moment matrices. Using…
We introduce the new problems of quantum packing, quantum covering, and quantum paving. These problems arise naturally when considering an algebra of non-commutative operators that is deeply rooted in quantum physics as well as in Gabor…
In this piece, we examine one variant of the infamous 15 Tile Puzzle and develop a mathematical backing behind why it is unsolvable. Using concepts of permutations, bijectivity, and cycle transpositions, we not only prove how to model this…
A quantum code is a subspace of a Hilbert space of a physical system chosen to be correctable against a given class of errors, where information can be encoded. Ideally, the quantum code lies within the ground space of the physical system.…
In classical computation, a problem can be solved in multiple steps where calculated results of each step can be copied and used repeatedly. While in quantum computation, it is difficult to realize a similar multi-step computation process…
The strategic Go game, known for the tedious mathematical complexities, has been used as a theme in many fiction, movies, and books. Here, we introduce the Go game and provide a new version of quantum Go in which the boxes are initially in…
Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model for a discrete-time quantum walk with…
Quantum cloning of two identical mixed qubits $\rho \otimes \rho $ is studied. We propose the quantum cloning transformations not only for the triplet (symmetric) states but also for the singlet (antisymmetric) state. We can copy these two…
The compatibility of standard and Bohmian quantum mechanics has recently been challenged in the context of two-particle interference, both from a theoretical and an experimental point of view. We analyze different setups proposed and derive…
Continuous-time quantum walk is one of the alternative approaches to quantum computation, where a universal set of quantum gates can be achieved by scattering a quantum walker on some specially-designed structures embedded in a sparse graph…
Quantum mechanics has enjoyed a multitude of successes since its formulation in the early twentieth century. At the same time, it has generated puzzles that persist to this day. These puzzles have inspired a large literature in physics and…
To solve tiling puzzles, such as "pentomino" or "tetromino" puzzles, we need to find the correct solutions out of numerous combinations of rotations or piece locations. Solving this kind of combinatorial optimization problem is a very…