arXiv subjects

Pranaw Rungta

Publications and source records attributed to Pranaw Rungta.

9 recordsLinked to original sources

arXiv2012

Algorithmic approach to simulate Hamiltonian dynamics and an NMR simulation of Quantum State Transfer

We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The algorithm product-decomposes $U$ in a chosen operator basis by identifying a certain symmetry of $U$ that is intimately related to the number of gates in the decomposition. We illustrate the algorithm by first obtaining a polynomial decomposition in the Pauli basis of the $n$-qubit Quantum State Transfer unitary by Di Franco et. al. (Phys. Rev. Lett. 101, 230502 (2008)) that transports quantum information from one end of a spin chain to the other; and then implement it in Nuclear Magnetic Resonance to demonstrate that the decomposition is experimentally viable and well-scaled. We furthur experimentally test the resilience of the state transfer to static errors in the coupling parameters of the simulated Hamiltonian. This is done by decomposing and simulating the corresponding imperfect unitaries.

quant-ph↗

arXiv2009

Svetlichny's inequality and genuine tripartite nonlocality in three-qubit pure states

The violation of the Svetlichny's inequality (SI) [Phys. Rev. D, 35, 3066 (1987)] is sufficient but not necessary for genuine tripartite nonlocal correlations. Here we quantify the relationship between tripartite entanglement and the maximum expectation value of the Svetlichny operator (which is bounded from above by the inequality) for the two inequivalent subclasses of pure three-qubit states: the GHZ-class and the W-class. We show that the maximum for the GHZ-class states reduces to Mermin's inequality [Phys. Rev. Lett. 65, 1838 (1990)] modulo a constant factor, and although it is a function of the three tangle and the residual concurrence, large number of states don't violate the inequality. We further show that by design SI is more suitable as a measure of genuine tripartite nonlocality between the three qubits in the the W-class states, and the maximum is a certain function of the bipartite entanglement (the concurrence) of the three reduced states, and only when their certain sum attains a certain threshold value, they violate the inequality.

quant-ph↗

arXiv2008

Symmetry-noise interplay in quantum walk on an n-cycle

Augmenting the unitary transformation which generates a quantum walk by a generalized phase gate G is a symmetry for both noisy and noiseless quantum walk on a line, in the sense that it leaves the position probability distribution invariant. However, this symmetry breaks down in the case of a quantum walk on an n-cycle, and hence can be regarded as a probe of the walk topology. Noise, modelled here as phase flip and generalized amplitude damping channels, tends to restore the symmetry because it classicalizes the walk. However, symmetry restoration happens even in the regime where the walker is not entirely classical, because noise also has the effect of desensitizing the operation G to the walk topology. We discuss methods for physical implementation, and talk about the wider implications to condensed matter systems.

quant-ph↗

arXiv2007

The quadratic speedup in Grover's search algorithm from the entanglement perspective

We analyze the role played by entanglement in the dynamical evolution of Grover's search algorithm in the space of qubits. We show that the algorithm can be equivalently described as an iterative change of the entanglement between the qubits, which governs the evolution of the initial state towards the target state, and where the entanglement can be quantified in terms a single entanglement monotone. We also provide a necessary and sufficient condition for the quadratic speedup, which illustrates how the change in the bipartite entanglement of the state after each iteration determines the corresponding increase in the probability of finding the target state. This allows us to reestablish from the entanglement perspective that Grover's search algorithm is the only optimal pure state search algorithm.

quant-ph↗

arXiv2005

Quantum Random Walks without a Coin Toss

We construct a quantum random walk algorithm, based on the Dirac operator instead of the Laplacian. The algorithm explores multiple evolutionary branches by superposition of states, and does not require the coin toss instruction of classical randomised algorithms. We use this algorithm to search for a marked vertex on a hypercubic lattice in arbitrary dimensions. Our numerical and analytical results match the scaling behaviour of earlier algorithms that use a coin toss instruction.

quant-ph↗

arXiv2005

Quantum Random Walks do not need a Coin Toss

Classical randomized algorithms use a coin toss instruction to explore different evolutionary branches of a problem. Quantum algorithms, on the other hand, can explore multiple evolutionary branches by mere superposition of states. Discrete quantum random walks, studied in the literature, have nonetheless used both superposition and a quantum coin toss instruction. This is not necessary, and a discrete quantum random walk without a quantum coin toss instruction is defined and analyzed here. Our construction eliminates quantum entanglement from the algorithm, and the results match those obtained with a quantum coin toss instruction.

quant-ph↗

arXiv2002

I-concurrence and tangle for isotropic states

We discuss properties of entanglement measures called I-concurrence and tangle. For a bipartite pure state, I-concurrence and tangle are simply related to the purity of the marginal density operators. The I-concurrence (tangle) of a bipartite mixed state is the minimum average I-concurrence (tangle) of ensemble decompositions of pure states of the joint density operator. Terhal and Vollbrecht [Phys. Rev. Lett. 85, 2625 (2000)] have given an explicit formula for the entanglement of formation of isotropic states in arbitrary dimensions. We use their formalism to derive comparable expressions for the I-concurrence and tangle of isotropic states.

quant-ph↗

arXiv2001

Universal state inversion and concurrence in arbitrary dimensions

Wootters [Phys. Rev. Lett. 80, 2245 (1998)] has given an explicit formula for the entanglement of formation of two qubits in terms of what he calls the concurrence of the joint density operator. Wootters's concurrence is defined with the help of the superoperator that flips the spin of a qubit. We generalize the spin-flip superoperator to a "universal inverter," which acts on quantum systems of arbitrary dimension, and we introduce the corresponding concurrence for joint pure states of (D1 X D2) bipartite quantum systems. The universal inverter, which is a positive, but not completely positive superoperator, is closely related to the completely positive universal-NOT superoperator, the quantum analogue of a classical NOT gate. We present a physical realization of the universal-NOT superoperator.

quant-ph↗

arXiv2000

Entanglement of Formation of an Arbitrary State of Two Rebits

We consider entanglement for quantum states defined in vector spaces over the real numbers. Such real entanglement is different from entanglement in standard quantum mechanics over the complex numbers. The differences provide insight into the nature of entanglement in standard quantum theory. Wootters [Phys. Rev. Lett. 80, 2245 (1998)] has given an explicit formula for the entanglement of formation of two qubits in terms of what he calls the concurrence of the joint density operator. We give a contrasting formula for the entanglement of formation of an arbitrary state of two ``rebits,'' a rebit being a system whose Hilbert space is a 2-dimensional real vector space.

quant-ph↗