Searcharxiv⌕ Search

arXiv subjects

R. Srikanth

Publications and source records attributed to R. Srikanth.

At least 145 records · Page 8Linked to original sources

An environment-mediated quantum deleter

Environment-induced decoherence presents a great challenge to realizing a quantum computer. We point out the somewhat surprising fact that decoherence can be useful, indeed necessary, for practical quantum computation, in particular, for the effective erasure of quantum memory in order to initialize the state of the quantum computer. The essential point behind the deleter is that the environment, by means of a dissipative interaction, furnishes a contractive map towards a pure state. We present a specific example of an amplitude damping channel provided by a two-level system's interaction with its environment in the weak Born-Markov approximation. This is contrasted with a purely dephasing, non-dissipative channel provided by a two-level system's interaction with its environment by means of a quantum nondemolition interaction. We point out that currently used state preparation techniques, for example using optical pumping, essentially perform as quantum deleters.

quant-ph↗

The quantum measurement problem and physical reality: a computation theoretic perspective

Is the universe computable? If yes, is it computationally a polynomial place? In standard quantum mechanics, which permits infinite parallelism and the infinitely precise specification of states, a negative answer to both questions is not ruled out. On the other hand, empirical evidence suggests that NP-complete problems are intractable in the physical world. Likewise, computational problems known to be algorithmically uncomputable do not seem to be computable by any physical means. We suggest that this close correspondence between the efficiency and power of abstract algorithms on the one hand, and physical computers on the other, finds a natural explanation if the universe is assumed to be algorithmic; that is, that physical reality is the product of discrete sub-physical information processing equivalent to the actions of a probabilistic Turing machine. This assumption can be reconciled with the observed exponentiality of quantum systems at microscopic scales, and the consequent possibility of implementing Shor's quantum polynomial time algorithm at that scale, provided the degree of superposition is intrinsically, finitely upper-bounded. If this bound is associated with the quantum-classical divide (the Heisenberg cut), a natural resolution to the quantum measurement problem arises. From this viewpoint, macroscopic classicality is an evidence that the universe is in BPP, and both questions raised above receive affirmative answers. A recently proposed computational model of quantum measurement, which relates the Heisenberg cut to the discreteness of Hilbert space, is briefly discussed. A connection to quantum gravity is noted. Our results are compatible with the philosophy that mathematical truths are independent of the laws of physics.

quant-ph↗

The quantum measurement problem as a witness to "It from bit"

A conceptual difficulty in the foundations of quantum mechanics is the quantum measurement problem (QMP), essentially concerned with the apparent non-unitarity of the measurement process and the classicality of macroscopic systems. In an information theoretic approach proposed by us earlier (Quantum Information Processing 2, 153, 2003), which we clarify and elaborate here, QMP is understood to signal a fundamental finite resolution of quantum states, or, equivalently, a discreteness of Hilbert space. This was motivated by the notion that physical reality is a manifestation of information stored and discrete computations performed at a deeper, sub-physical layer. This model entails that states of sufficiently complex, entangled systems will be unresolvable, or, {\em computationally unstable}. Wavefunction collapse is postulated as an error preventive response to such computational instability. In effect, sufficiently complex systems turn classical because of the finiteness of the computational resources available to the physical universe. We show that this model forms a reasonable complement to decoherence for resolving QMP, both in respect of the problem of definite outcomes and of the preferred basis problem. The model suggests that QMP, as a window on the sub-physical universe, serves as a witness to Wheeler's koan ``it from bit''. Some implications for quantum computation and quantum gravity are examined.

quant-ph↗

A combinatorial approach for studying LOCC transformations of multipartite states

We develop graph theoretic methods for analysing maximally entangled pure states distributed between a number of different parties. We introduce a technique called {\it bicolored merging}, based on the monotonicity feature of entanglement measures, for determining combinatorial conditions that must be satisfied for any two distinct multiparticle states to be comparable under local operations and classical communication (LOCC). We present several results based on the possibility or impossibility of comparability of pure multipartite states. We show that there are exponentially many such entangled multipartite states among $n$ agents. Further, we discuss a new graph theoretic metric on a class of multi-partite states, and its implications.

quant-ph↗

Non-destructive Orthonormal State Discrimination

We provide explicit quantum circuits for the non-destructive deterministic discrimination of Bell states in the Hilbert space $C^{d^{n}}$, where $d$ is qudit dimension. We discuss a method for generalizing this to non-destructive measurements on any set of orthogonal states distributed among $n$ parties. From the practical viewpoint, we show that such non-destructive measurements can help lower quantum communication complexity under certain conditions.

quant-ph↗

Generalized Quantum Secret Sharing

We explore a generalization of quantum secret sharing (QSS) in which classical shares play a complementary role to quantum shares, exploring further consequences of an idea first studied by Nascimento, Mueller-Quade and Imai (Phys. Rev. {\bf A64} 042311 (2001)). We examine three ways, termed inflation, compression and twin-thresholding, by which the proportion of classical shares can be augmented. This has the important application that it reduces quantum (information processing) players by replacing them with their classical counterparts, thereby making quantum secret sharing considerably easier and less expensive to implement in a practical setting. In compression, a QSS scheme is turned into an equivalent scheme with fewer quantum players, compensated for by suitable classical shares. In inflation, a QSS scheme is enlarged by adding only classical shares and players. In a twin-threshold scheme, we invoke two separate thresholds for classical and quantum shares based on the idea of information dilution.

quant-ph↗

Quantum seals

A quantum seal is a way of encoding a message into quantum states, so that anybody may read the message with little error, while authorized verifiers can detect that the seal has been broken. We present a simple extension to the Bechmann-Pasquinucci majority-voting scheme that is impervious to coherent attacks, and further, encompasses sealing quantum messages by means of quantum encryption. The scheme is relatively easy to implement, requiring neither entanglement nor controlled operations during the state preparation, reading or verification stages.

quant-ph↗

Quantum Bit Commitment with a Composite Evidence

Entanglement-based attacks, which are subtle and powerful, are usually believed to render quantum bit commitment insecure. We point out that the no-go argument leading to this view implicitly assumes the evidence-of-commitment to be a monolithic quantum system. We argue that more general evidence structures, allowing for a composite, hybrid (classical-quantum) evidence, conduce to improved security. In particular, we present and prove the security of the following protocol: Bob sends Alice an anonymous state. She inscribes her commitment $b$ by measuring part of it in the + (for $b = 0$) or $\times$ (for $b=1$) basis. She then communicates to him the (classical) measurement outcome $R_x$ and the part-measured anonymous state interpolated into other, randomly prepared qubits as her evidence-of-commitment.

quant-ph↗

Assisted Quantum Secret Sharing

A restriction on quantum secret sharing (QSS) that comes from the no-cloning theorem is that any pair of authorized sets in an access structure should overlap. From the viewpoint of application, this places an unnatural constraint on secret sharing. We present a generalization, called assisted QSS (AQSS), where access structures without pairwise overlap of authorized sets is permissible, provided some shares are withheld by the share dealer. We show that no more than $λ-1$ withheld shares are required, where $λ$ is the minimum number of {\em partially linked classes} among the authorized sets for the QSS. This is useful in QSS schemes where the share dealer is honest by definition and is equivalent to a secret reconstructor. Our result means that such applications of QSS need not be thwarted by the no-cloning theorem.

quant-ph↗

Relationship between Horizontal Flow Velocity and Cell Lifetime for Supergranulation

A study of 50 supergranular cells obtained from SOHO Dopplergrams was undertaken in order to investigate the relationship between the lifetime ($T$) and the horizontal flow velocity ($v_h$) of the cells. For this sample we find that the two parameters are correlated with a relation $v_h\propto T^{0.5}$ and $T$ is identified with the eddy turn-over time. This is in agreement with the turbulent convective model of the solar atmosphere where the velocity spectrum of supergranular field given by '$v_h \propto L^{1/3}$' can be identified with the Kolmogorov spectrum for the eddy size $L$.

physics.plasm-ph↗

Computable Functions, the Church-Turing Thesis and the Quantum Measurement Problem

It is possible in principle to construct quantum mechanical observables and unitary operators which, if implemented in physical systems as measurements and dynamical evolution, would contradict the Church-Turing thesis, which lies at the foundation of computer science. Elsewhere we have argued that the quantum measurement problem implies a finite, computational model of the measurement and evolution of quantum states. If correct, this approach helps to identify the key feature that can reconcile quantum mechanics with the Church-Turing thesis: finitude of the degree of fine-graining of Hilbert space. This suggests that the Church-Turing thesis constrains the physical universe and thereby highlights a surprising connection between purely logical and algorithmic considerations on the one hand and physical reality on the other.

quant-ph↗

Unconditionally Secure Multipartite Quantum Key Distribution

We consider the problem of secure key distribution among $n$ trustful agents: the goal is to distribute an identical random bit-string among the $n$ agents over a noisy channel such that eavesdroppers learn little about it. We study the general situation where the only resources required are secure bipartite key distribution and authenticated classical communication. Accordingly, multipartite quantum key distribution can be proven unconditionally secure by reducing the problem to the biparitite case and invoking the proof of security of bipartite quantum key distribution.

quant-ph↗

A Computational Model for Quantum Measurement

Is the dynamical evolution of physical systems objectively a manifestation of information processing by the universe? We find that an affirmative answer has important consequences for the measurement problem. In particular, we calculate the amount of quantum information processing involved in the evolution of physical systems, assuming a finite degree of fine-graining of Hilbert space. This assumption is shown to imply that there is a finite capacity to sustain the immense entanglement that measurement entails. When this capacity is overwhelmed, the system's unitary evolution becomes computationally unstable and the system suffers an information transition (`collapse'). Classical behaviour arises from the rapid cycles of unitary evolution and information transitions. Thus, the fine-graining of Hilbert space determines the location of the `Heisenberg cut', the mesoscopic threshold separating the microscopic, quantum system from the macroscopic, classical environment. The model can be viewed as a probablistic complement to decoherence, that completes the measurement process by turning decohered improper mixtures of states into proper mixtures. It is shown to provide a natural resolution to the measurement problem and the basis problem.

quant-ph↗

Securing quantum bit commitment through reverse quantum communication

Einstein-Podolsky-Rosen- (EPR) and the more powerful Mayers-Lo-Chau attack impose a serious constraint on quantum bit commitment (QBC). As a way to circumvent them, it is proposed that the quantum system encoding the commitment chosen by the committer (Alice) should be initially prepared in a seperable quantum state known to and furnished by the acceptor (Bob), rather than Alice. Classical communication is used to conclude the commitment phase and bind Alice's subsequent unveiling. Such a class of secure protocols can be built upon currently proposed QBC schemes impervious to a simple EPR attack. A specific scheme based on the Brassard-Crepeau-Josza-Langlois protocol is presented here as an example.

quant-ph↗

Single particle nonlocality: A proposed experimental test

We show that controlled interference of a particle's wavefunction can be used to perform a quantum mechanical measurement in an incomplete basis. This happens because the measurement projects the particle into a lower dimensional subspace of the Hilbert space of the incoming wave. It allows a sender (Alice) to signal the receiver (Bob) nonlocally, by Alice's choosing to measure in a complete or incomplete basis (in general: bases of differing incompleteness). If experimentally confirmed, it furnishes a new quantum communication act: nonlocal transmission of a bit without concomitant causal communication. However, the question of its compatibility with special relativity remains unresolved.

quant-ph↗

Classical Communication via the Einstein-Podolsky-Rosen Channel Alone: A Proposed Experimental Test

We uncover an apparent instance of classical information transfer via only the Einstein-Podolsky-Rosen channel in a quantum optical protocol between Alice and Bob, involving two-photon maximal path entanglement and based on a recent Innsbruck experiment. The signal is traced to the appearance of coherent reduction due to the onset of spatial degeneracy in the eigenvalue spectrum for Alice's measurement. We present our result primarily as an issue for experimental testing rather than as a definitive prediction at this stage.

quant-ph↗

A quantum field theoretic description of the delayed choice experiment

Wheeler's delayed choice experiment, a well known manifestation of the complementarity principle, has proved somewhat difficult to physically interpret. We show that, restated in quantum field theoretic language, the experiment submits to a simple explanation: that wave- or particle-nature is imposed not at the slit plane but at the detector system. The intepretational difficulty conventionally encountered is due to the assumption of enforcement of complementarity at the former.

quant-ph↗

Do Quantum Nonlocal Correlations Imply Information Transfer?- A Gedanken Experiment

We study a generalization of the original Einstein-Podolsky-Rosen thought experiment. It is essentially a delayed choice experiment as applied to entangled particles. The basic idea is: given two observers sharing position-momentum entangled photons, one party chooses whether she measures position or momentum of her photons after the particles leave the source. The other party should infer her action by checking for the absence or presence of characteristic interference patterns after subjecting his particles to certain optical pre-processing. An occurance of apparent signaling is attributed to the difficulty in treating single photons simultaneously at a quantum mechanical and quantum electrodynamic level, as required by the experiment, and points to the need for a careful study of an aspect of the foundations of quantum mechanics and electrodynamics.

quant-ph↗