Related papers: Limitations on Cloning in Classical Mechanics
We introduce into classical mechanics the concept of non-discerned particles for particles that are identical, non-interacting and prepared in the same way. The non-discerned particles correspond to an action and a density which satisfy the…
we envisage a novel quantum cloning machine, which takes an input state and produces an output state whose success branch can exist in a linear superposition of multiple copies of the input state and the failure branch exist in a…
This thesis investigates quantum cloning and related quantum entanglement problems using core concepts of representation theory, in particular those associated with the symmetric group. The research explores Schur-Weyl duality and its…
The problem of quantum state reduction in the process of measurement has attracted attention of almost everyone who created, developed or explained quantum physics to the students. Absence of a solution is the basis for the statement that…
Quantum mechanics and classical mechanics are two very different theories, but the correspondence principle states that quantum particles behave classically in the limit of high quantum number. In recent years much research has been done on…
Perfect Quantum Cloning Machines (QCM) would allow to use quantum nonlocality for arbitrary fast signaling. However perfect QCM cannot exist. We derive a bound on the fidelity of QCM compatible with the no-signaling constraint. This bound…
Quantum mechanics promises computational powers beyond the reach of classical computers. Current technology is on the brink of an experimental demonstration of the superior power of quantum computation compared to classical devices. For…
Here I explore a novel no-collapse interpretation of quantum mechanics which combines aspects of two familiar and well-developed alternatives, Bohmian mechanics and the many-worlds interpretation. Despite reproducing the empirical…
The classical PCP theorem is arguably the most important achievement of classical complexity theory in the past quarter century. In recent years, researchers in quantum computational complexity have tried to identify approaches and develop…
We construct a non-Grassmann spinning-particle model which, by analogy with quantum mechanics, does not admit the notion of a trajectory within the position space. The pseudo-classical character of the model allows us to avoid the…
We present some results that show that bounds from classical coding theory still work in many cases of quantum coding theory.
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.…
We show that classical mechanics can be recovered as the high-entropy limit of quantum mechanics. That is, the high entropy masks quantum effects, and mixed states of high enough entropy can be approximated with classical distributions. The…
Instead of producing quantum languages that are fit for current quantum computers, we build a language from standard classical assembler and augment it with quantum capabilities so that quantum algorithms become a subset of it. This paves…
A definition of quantum mechanical work is introduced in this dissertation, preserving the mathematical structure of the Classical Mechanics concept of work without, however, in any way invoking the notion of trajectory. By use of Gaussian…
Quantum cloning is an essential operation in quantum information and quantum computing. Similar to the `copy' operation in classical computing, the cloning of flying bits for further processing from the solid-state quantum bits in storage…
Recently, increased computational power and data availability, as well as algorithmic advances, have led machine learning techniques to impressive results in regression, classification, data-generation and reinforcement learning tasks.…
A long sequence of tosses of a classical coin produces an apparently random bit string, but classical randomness is an illusion: the algorithmic information content of a classically-generated bit string lies almost entirely in the…
According to the Gottesman-Knill theorem, quantum algorithms which utilise only the operations belonging to a certain restricted set are efficiently simulable classically. Since some of the operations in this set generate entangled states,…
We show that unitarity does not allow cloning of any two points in a ray. This has implication for cloning of the geometric phase information in a quantum state. In particular, the quantum history which is encoded in the geometric phase…