Searcharxiv⌕ Search

arXiv subjects

Arun K. Pati

Publications and source records attributed to Arun K. Pati.

At least 37 records · Page 2Linked to original sources

Infinitesimal change is a Non-local Operation: Hidden power of Quantum Entanglement

We show that the global infinitesimal change in the multi-particle pure product state gives rise to an entangled state. This suggests that even if there is no interaction present between the subsystems, i.e., at each time instant the state is non-entangled, the tangent vector is typically entangled. Since the tangent space vectors tell the state-space vectors how to change this implies that quantum entanglement is necessary for motion or change in general. This is truly a `hidden power' of quantum entanglement. During quantum computation even though at each time instant the state is not entangled, quantum entanglement guides the process of computation. This observation applies to multi-particle pure, pseudo-pure and mixed states as well.

quant-ph↗

No partial erasure of quantum information

In complete erasure any arbitrary pure quantum state is transformed to a fixed pure state by irreversible operation. Here we ask if the process of partial erasure of quantum information is possible by general quantum operations, where partial erasure refers to reducing the dimension of the parameter space that specifies the quantum state. Here we prove that quantum information stored in qubits and qudits cannot be partially erased, even by irreversible operations. The no-flipping theorem, which rules out the existence of a universal NOT gate for an arbitrary qubit, emerges as a corollary to this theorem. The `no partial erasure' theorem is shown to apply to spin and bosonic coherent states, with the latter result showing that the `no partial erasure' theorem applies to continuous variable quantum information schemes as well. The no partial erasure theorem suggests an integrity principle that quantum information is indivisible.

quant-ph↗

Quantum History cannot be Copied

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 during cyclic evolution of a quantum system cannot be copied. We also prove that the generalized geometric phase information cannot be copied by a unitary operation. We argue that our result also holds in the consistent history formulation of quantum mechanics.

quant-ph↗

Replication and Evolution of Quantum Species

We dwell upon the physicist's conception of `life' since Schroedinger and Wigner through to the modern-day language of living systems in the light of quantum information. We discuss some basic features of a living system such as ordinary replication and evolution in terms of quantum bio-information. We also discuss the principle of no-culling of living replicas. We show that in a collection of identical species there can be no entanglement between one of the mutated copies and the rest of the species in a closed universe. Even though these discussions revolve around `artificial life' they may still be applicable in real biological systems under suitable conditions.

quant-ph↗

Mixed state geometric phases, entangled systems, and local unitary transformations

The geometric phase for a pure quantal state undergoing an arbitrary evolution is a ``memory'' of the geometry of the path in the projective Hilbert space of the system. We find that Uhlmann's geometric phase for a mixed quantal state undergoing unitary evolution not only depends on the geometry of the path of the system alone but also on a constrained bi-local unitary evolution of the purified entangled state. We analyze this in general, illustrate it for the qubit case, and propose an experiment to test this effect. We also show that the mixed state geometric phase proposed recently in the context of interferometry requires uni-local transformations and is therefore essentially a property of the system alone.

quant-ph↗

Quantum deleting and Signalling

It is known that if we can clone an arbitrary state we can send signal faster than light. Here, we show that deletion of unknown quantum state against a copy can lead to superluminal signalling. But erasure of unknown quantum state does not imply faster than light signalling.

quant-ph↗

Quantum mechanical Universal constructor

Arbitrary quantum states cannot be copied. In fact, to make a copy we must provide complete information about the system. However, can a quantum system self-replicate? This is not answered by the no-cloning theorem. In the classical context, Von Neumann showed that a `universal constructor' can exist which can self-replicate an arbitrary system, provided that it had access to instructions for making copy of the system. We question the existence of a universal constructor that may allow for the self-replication of an arbitrary quantum system. We prove that there is no deterministic universal quantum constructor which can operate with finite resources. Further, we delineate conditions under which such a universal constructor can be designed to operate dterministically and probabilistically.

quant-ph↗

Relative phase change during quantum operation

Quantum operations represented by completely positive maps encompass many of the physical processes and have been very powerful in describing quantum computation and information processing tasks. We introduce the notion of relative phase change for a quantum system undergoing quantum operation. We find that the relative phase shift of a system not only depends on the state of the system, but also depends on the initial state of the ancilla with which it might have interacted in the past. The relative phase change during a sequence of quantum operations is shown to be non-additive in nature. This property can attribute a `memory' to a quantum channel. Also the notion of relative phase shift helps us to define what we call `in-phase quantum channels'. We will present the relative phase shift for a qubit undergoing depolarizing channel and complete randomization and discuss their implications.

quant-ph↗

Remote state preparation and measurement of single photon

Quantum information theory has revolutionized the way in which information is processed using quantum resources such as entangled states, local operations and classical communications. Two important protocols in quantum communications are quantum teleportation and remote state preparation. In quantum teleportation neither the sender nor the receiver know the identity of a state. In remote state preparation the sender knows the state which is to be remotely prepared without ever physically sending the object or the complete classical description of it. Using one unit of entanglement and one classical bit Alice can remotely prepare a photon (from special ensemble) of her choice at Bob's laboratory. In remote state measurement Alice asks Bob to simulate any single particle measurement statistics on an arbitrary photon. In this talk we will present these ideas and discuss the latest developments and future open problems.

quant-ph↗

Probabilistic Quantum Teleportation

We consider a generalized quantum teleportation protocol for an unknown qubit using non-maximally entangled state as a shared resource. Without recourse to local filtering or entanglement concentration, using standard Bell-state measurement and classical communication one cannot teleport the state with unit fidelity and unit probability. We show that using non-maximally entangled measurements one can teleport an unknown state with unit fidelity albeit with reduced probability, hence probabilistic teleportation. We also give a generalized protocol for entanglement swapping using non-maximally entangled states.

quant-ph↗

General impossible operations in quantum information

We prove a general limitation in quantum information that unifies the impossibility principles such as no-cloning and no-anticloning. Further, we show that for an unknown qubit one cannot design a universal Hadamard gate for creating equal superposition of the original and its complement state. Surprisingly, we find that Hadamard transformations exist for an unknown qubit chosen either from the polar or equatorial great circles. Also, we show that for an unknown qubit one cannot design a universal unitary gate for creating unequal superpositions of the original and its complement state. We discuss why it is impossible to design a controlled-NOT gate for two unknown qubits and discuss the implications of these limitations.

quant-ph↗

Deutsch-Jozsa algorithm for continuous variables

We present an idealized quantum continuous variable analog of the Deutsch-Jozsa algorithm which can be implemented on a perfect continuous variable quantum computer. Using the Fourier transformation and XOR gate appropriate for continuous spectra we show that under ideal operation to infinite precision that there is an infinite reduction in number of query calls in this scheme.

quant-ph↗

Speed-up and entanglement in quantum searching

We investigate the issue of speed-up and the necessity of entanglement in Grover's quantum search algorithm. We find that in a pure state implementation of Grover's algorithm entanglement is present even though the initial and target states are product states. In pseudo-pure state implementations, the separability of the states involved defines an entanglement boundary in terms of a bound on the purity parameter. Using this bound we investigate the necessity of entanglement in quantum searching for these pseudo-pure state implementations. If every active molecule involved in the ensemble is `charged for' then in existing machines speed-up without entanglement is not possible.

quant-ph↗

Generalization of geometric phase to completely positive maps

We generalize the notion of relative phase to completely positive maps with known unitary representation, based on interferometry. Parallel transport conditions that define the geometric phase for such maps are introduced. The interference effect is embodied in a set of interference patterns defined by flipping the environment state in one of the two paths. We show for the qubit that this structure gives rise to interesting additional information about the geometry of the evolution defined by the CP map.

quant-ph↗

Interference due to Coherence Swapping

We propose a method called `coherence swapping' which enables us to create superposition of a particle in two distinct paths, which is fed with initially incoherent, independent radiations. This phenomenon is also present for the charged particles, and can be used to swap the effect of flux line due to Aharonov-Bohm effect. We propose an optical version of the experimental set-up to test the coherence swapping. The phenomenon, which is simpler than entanglement swapping or teleportation, raises some fundamental questions about true nature of wave-particle duality, and also opens up the possibility of studying the quantum erasure from a new angle.

quant-ph↗

Quantum no-deleting principle and some of its implications

Unmeasureability of a quantum state has important consequences in practical implementation of quantum computers. Like copying, deleting of an unknown state from among several copies is prohibited. This is called no-deletion prinicple. Here, we present a no deleting principle for qudits. We obtain a bound on $N$-to-$M$ deleting and show that the quality of deletion drops exponentially with the number of copies to be deleted. In addition, we investigate conditional, state-dependent and approximate quantum deleting of unknown states. We prove that unitarity does not allow us to delete copies from an alphabet of two non-orthogonal states exactly. Further, we show that no-deleting principle is consistent with no-signalling.

quant-ph↗

Minimum cbits for remote preperation and measurement of a qubit

We show that a qubit chosen from equatorial or polar great circles on a Bloch spehere can be remotely prepared with one cbit from Alice to Bob if they share one ebit of entanglement. Also we show that any single particle measurement on an arbitrary qubit can be remotely simulated with one ebit of shared entanglement and communication of one cbit.

quant-ph↗

Existence of the Schmidt decomposition for tripartite systems

For any bipartite quantum system the Schmidt decomposition allows us to express the state vector in terms of a single sum instead of double sums. We show the existence of the Schmidt decomposition for tripartite system under certain condition. If the partial inner product of a basis (belonging to a Hilbert space of smaller dimension) with the state of the composite system gives a disentangled basis, then the Schmidt decomposition for a tripartite system exists. In this case the reduced density matrix of each of the subsystem has equal spectrum in the Schmidt basis.

quant-ph↗