Related papers: (Constrained) Quantization Without Tears
Adiabatic quantum computing (AQC) is a promising approach for discrete and often NP-hard optimization problems. Current AQCs allow to implement problems of research interest, which has sparked the development of quantum representations for…
Quantum cryptography is reviewed, first using entanglement both for the intuition and for the experimental realizations. Next, the implementation is simplified in several steps until it becomes practical. At this point entanglement has…
We analyze the estimation of a finite ensemble of quantum bits which have been sent through a depolarizing channel. Instead of using the depolarized qubits directly, we first apply a purification step and show that this improves the…
For diffusion-reaction equations employing a splitting procedure is attractive as it reduces the computational demand and facilitates a parallel implementation. Moreover, it opens up the possibility to construct second-order integrators…
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a…
A new scheme of field quantization is proposed. Instead of associating with different frequencies different oscillators we begin with a single oscillator that can exist in a superposition of different frequencies. The idea is applied to the…
A careful reexamination of the quantization of systems with first- and second-class constraints from the point of view of coherent-state phase-space path integration reveals several significant distinctions from more conventional…
We discuss alternative iteration methods for differential equations. We provide a convergence proof for exactly solvable examples and show more convenient formulas for nontrivial problems.
Quantization of free Dirac fields is formulated in terms of a reducible representation of CAR. Similarly to the bosonic case we arrive at field operators which are indeed operators and not operator valued distributions. Observables such as…
Even though entanglement is very vulnerable to interactions with the environment, it can be created by purely dissipative processes. Yet, the attainable degree of entanglement is profoundly limited in the presence of noise sources. We show…
We present a way for the entanglement distillation of genuine mixed state. Different from the conventional mixed state in entanglement purification protocol, each components of the mixed state in our protocol is a less-entangled state,…
We perform a one-dimensional complexified quaternionic version of the Dirac equation based on $i$-complex geometry. The problem of the missing complex parameters in Quaternionic Quantum Mechanics with $i$-complex geometry is overcome by a…
We present a new explanation for a quantum eraser. Mathematical description of the traditional explanation needs quantum-superposition states. However, the phenomenon can be explained without quantum-superposition states by introducing…
It is demonstrated that the so-called "unavoidable quantum anomalies" can be avoided in the farmework of a special non-linear quantization scheme. A simple example is discussed in detail.
Distillation of entanglement using only Gaussian operations is an important primitive in quantum communication, quantum repeater architectures, and distributed quantum computing. Existing distillation protocols for continuous degrees of…
We investigate the issue of assisted coherence distillation in the asymptotic limit (considering infinite copies of the resource states), by coordinately performing the identical local operations on the auxiliary systems of each copy. When…
We consider entanglement distillation with noisy operations in which quantum measurements that constitute a general quantum operation are particularly noisy. We present a protocol for purifying noisy measurements and show that imperfect…
We often add arithmetic to extend the expressiveness of query languages and study the complexity of problems such as testing query containment and finding certain answers in the framework of answering queries using views. When adding…
A toy model (suggested by Klauder) is analyzed from the perspective of First Class and Second Class Dirac constrained systems. The comparison is made by turning a First Class into a Second Class system with the introduction of suitable…
We analyze the canonical treatment of classical constrained mechanical systems formulated with a discrete time. We prove that under very general conditions, it is possible to introduce nonsingular canonical transformations that preserve the…