arXiv subjects

G. Passante

Publications and source records attributed to G. Passante.

6 recordsLinked to original sources

arXiv2012

Measuring geometric quantum discord using one bit of quantum information

We describe an efficient DQC1-algorithm to quantify the amount of Geometric Quantum Discord present in the output state of a DQC1 computation. DQC1 is a model of computation that utilizes separable states to solve a problem with no known efficient classical algorithm and is known to contain quantum correlations as measured by the discord. For the general case of a (1+n)-qubit DQC1-state we provide an analytical expression for the Geometric Quantum Discord and find that its typical (and maximum) value decreases exponentially with n. This is in contrast to the standard Quantum Discord whose value for typical DQC1-states is known to be independent of n. We experimentally demonstrate the proposed algorithm on a four-qubit liquid-state nuclear magnetic resonance quantum information processor. In the special case of a two-qubit DQC1 model, we also provide an expression for the Quantum Discord that only requires the outcome of the DQC1 algorithm.

quant-ph↗

arXiv2011

Experimental detection of non-classical correlations in mixed state quantum computation

We report on an experiment to detect non-classical correlations in a highly mixed state. The correlations are characterized by the quantum discord and are observed using four qubits in a liquid state nuclear magnetic resonance quantum information processor. The state analyzed is the output of a DQC1 computation, whose input is a single quantum bit accompanied by n maximally mixed qubits. This model of computation outperforms the best known classical algorithms, and although it contains vanishing entanglement it is known to have quantum correlations characterized by the quantum discord. This experiment detects non-vanishing quantum discord, ensuring the existence of non-classical correlations as measured by the quantum discord.

quant-ph↗

arXiv2010

Geometric measures of entanglement and the Schmidt decomposition

In the standard geometric approach, the entanglement of a pure state is $\sin^2θ$, where $θ$ is the angle between the entangled state and the closest separable state of products of normalised qubit states. We consider here a generalisation of this notion by considering separable states that consist of products of unnormalised states of different dimension. The distance between the target entangled state and the closest unnormalised product state can be interpreted as a measure of the entanglement of the target state. The components of the closest product state and its norm have an interpretation in terms of, respectively, the eigenvectors and eigenvalues of the reduced density matrices arising in the Schmidt decomposition of the state vector. For several cases where the target state has a large degree of symmetry, we solve the system of equations analytically, and look specifically at the limit where the number of qubits is large.

quant-ph↗

arXiv2009

Experimental approximation of the Jones polynomial with DQC1

We present experimental results approximating the Jones polynomial using 4 qubits in a liquid state nuclear magnetic resonance quantum information processor. This is the first experimental implementation of a complete problem for the deterministic quantum computation with one quantum bit model of quantum computation, which uses a single qubit accompanied by a register of completely random states. The Jones polynomial is a knot invariant that is important not only to knot theory, but also to statistical mechanics and quantum field theory. The implemented algorithm is a modification of the algorithm developed by Shor and Jordan suitable for implementation in NMR. These experimental results show that for the restricted case of knots whose braid representations have four strands and exactly three crossings, identifying distinct knots is possible 91% of the time.

quant-ph↗

arXiv2007

Geometric measures of entanglement and the Schmidt decomposition

In the standard geometric approach to a measure of entanglement of a pure state, $\sin^2θ$ is used, where $θ$ is the angle between the state to the closest separable state of products of normalized qubit states. We consider here a generalization of this notion to separable states consisting of products of unnormalized states of different dimension. In so doing, the entanglement measure $\sin^2θ$ is found to have an interpretation as the distance between the state to the closest separable state. We also find the components of the closest separable state and its norm have an interpretation in terms of, respectively, the eigenvectors and eigenvalues of the reduced density matrices arising in the Schmidt decomposition of the state vector.

quant-ph↗

arXiv2006

The Dynamics of Entanglement in the Adiabatic Search and Deutsch Algorithms

The goal of this paper is to study the effect of entanglement on the running time of a quantum computation. Adiabatic quantum computation is suited to this kind of study, since it allows us to explicitly calculate the time evolution of the entanglement throughout the calculation. On the other hand however, the adiabatic formalism makes it impossible to study the roles of entanglement and fidelity separately, which means that results have to be interpreted carefully. We study two algorithms: the search algorithm and the Deutsch-Jozsa algorithm. We find some evidence that entanglement can be considered a resource in quantum computation.

quant-ph↗