COMPLEXITY MEASURE: A QUANTUM INFORMATION APPROACH

In the past decades, all of the efforts at quantifying systems complexity with a general tool has usually relied on using Shannon's classical information framework to address the disorder of the system through the Boltzmann-Gibbs-Shannon entropy, or one of its extensions. However, in recent years, there were some attempts to tackle the quantification of algorithmic complexities in quantum systems based on the Kolmogorov algorithmic complexity, obtaining some discrepant results against the classical approach. Therefore, an approach to the complexity measure is proposed here, using the quantum information formalism, taking advantage of the generality of the classical-based complexities, and being capable of expressing these systems' complexity on other framework than its algorithmic counterparts. To do so, the Shiner-Davison-Landsberg (SDL) complexity framework is considered jointly with linear entropy for the density operators representing the analyzed systems formalism along with the tangle for the entanglement measure. The proposed measure is then applied in a family of maximally entangled mixed state.

Enhanced dynamical entanglement transfer with multiple qubits

We present two strategies to enhance the dynamical entanglement transfer from continuous-variable (CV) to finite-dimensional systems by employing multiple qubits. First, we consider the entanglement transfer to a composite finite-dimensional system of many qubits simultaneously interacting with a bipartite CV field. We show that, considering realistic conditions in the generation of CV entanglement, a small number of qubits resonantly coupled to the CV system are sufficient for an almost complete dynamical transfer of the entanglement. Our analysis also sheds further light on the transition between the microscopic and macroscopic behaviors of composite finite-dimensional systems coupled to bosonic fields (like atomic clouds interacting with light). Furthermore, we present a protocol based on sequential interactions of the CV system with some ancillary qubit systems and on subsequent measurements, allowing us to probabilistically convert CV entanglement into "almost-perfect" Bell pairs of two qubits. Our proposals are suited for realizations in various experimental settings, ranging from cavity-QED to cavity-integrated superconducting devices.

On the cubicity of bipartite graphs

A unit cube in k-dimension (or a k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k, where each R-i is a closed interval on the real line of the form [a(j), a(i), + 1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. Many NP-complete graph problems can be solved efficiently or have good approximation ratios in graphs of low cubicity. In most of these cases the first step is to get a low dimensional cube representation of the given graph. It is known that for graph G, cub(G) <= left perpendicular2n/3right perpendicular. Recently it has been shown that for a graph G, cub(G) >= 4(Delta + 1) In n, where n and Delta are the number of vertices and maximum degree of G, respectively. In this paper, we show that for a bipartite graph G = (A boolean OR B, E) with |A| = n(1), |B| = n2, n(1) <= n(2), and Delta' = min {Delta(A),Delta(B)}, where Delta(A) = max(a is an element of A)d(a) and Delta(B) = max(b is an element of B) d(b), d(a) and d(b) being the degree of a and b in G, respectively , cub(G) <= 2(Delta' + 2) bar left rightln n(2)bar left arrow. We also give an efficient randomized algorithm to construct the cube representation of G in 3 (Delta' + 2) bar right arrowIn n(2)bar left arrow dimension. The reader may note that in general Delta' can be much smaller than Delta.

A note on acyclic edge coloring of complete bipartite graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic (2-colored) cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). Let Delta = Delta(G) denote the maximum degree of a vertex in a graph G. A complete bipartite graph with n vertices on each side is denoted by K-n,K-n. Alon, McDiarmid and Reed observed that a'(K-p-1,K-p-1) = p for every prime p. In this paper we prove that a'(K-p,K-p) <= p + 2 = Delta + 2 when p is prime. Basavaraju, Chandran and Kummini proved that a'(K-n,K-n) >= n + 2 = Delta + 2 when n is odd, which combined with our result implies that a'(K-p,K-p) = p + 2 = Delta + 2 when p is an odd prime. Moreover we show that if we remove any edge from K-p,K-p, the resulting graph is acyclically Delta + 1 = p + 1-edge-colorable. (C) 2009 Elsevier B.V. All rights reserved.

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 Greenberger-Horne-Zeilinger (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 numbers of states do not 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 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 sum attains a certain threshold value do they violate the inequality.

Chordal Bipartite Graphs with High Boxicity

The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite graphs that do not contain an induced cycle of length greater than 4. It was conjectured by Otachi, Okamoto and Yamazaki that chordal bipartite graphs have boxicity at most 2. We disprove this conjecture by exhibiting an infinite family of chordal bipartite graphs that have unbounded boxicity.

Bipartite Powers of k-chordal Graphs

Let k be an integer and k >= 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs. Duchet proved that, for every positive integer m, if G m is chordal then so is G(m+2). Brandst `` adt et al. in Andreas Brandsadt, Van Bang Le, and Thomas Szymczak. Duchet- type theorems for powers of HHD- free graphs. Discrete Mathematics, 177(1- 3): 9- 16, 1997.] showed that if G m is k - chordal, then so is G(m+2). Powering a bipartite graph does not preserve its bipartitedness. In order to preserve the bipartitedness of a bipartite graph while powering Chandran et al. introduced the notion of bipartite powering. This notion was introduced to aid their study of boxicity of chordal bipartite graphs. The m - th bipartite power G(m]) of a bipartite graph G is the bipartite graph obtained from G by adding edges (u; v) where d G (u; v) is odd and less than or equal to m. Note that G(m]) = G(m+1]) for each odd m. In this paper we show that, given a bipartite graph G, if G is k-chordal then so is G m], where k, m are positive integers with k >= 4

Surrogate Regret Bounds for Bipartite Ranking via Strongly Proper Losses

The problem of bipartite ranking, where instances are labeled positive or negative and the goal is to learn a scoring function that minimizes the probability of mis-ranking a pair of positive and negative instances (or equivalently, that maximizes the area under the ROC curve), has been widely studied in recent years. A dominant theoretical and algorithmic framework for the problem has been to reduce bipartite ranking to pairwise classification; in particular, it is well known that the bipartite ranking regret can be formulated as a pairwise classification regret, which in turn can be upper bounded using usual regret bounds for classification problems. Recently, Kotlowski et al. (2011) showed regret bounds for bipartite ranking in terms of the regret associated with balanced versions of the standard (non-pairwise) logistic and exponential losses. In this paper, we show that such (non-pairwise) surrogate regret bounds for bipartite ranking can be obtained in terms of a broad class of proper (composite) losses that we term as strongly proper. Our proof technique is much simpler than that of Kotlowski et al. (2011), and relies on properties of proper (composite) losses as elucidated recently by Reid and Williamson (2010, 2011) and others. Our result yields explicit surrogate bounds (with no hidden balancing terms) in terms of a variety of strongly proper losses, including for example logistic, exponential, squared and squared hinge losses as special cases. An important consequence is that standard algorithms minimizing a (non-pairwise) strongly proper loss, such as logistic regression and boosting algorithms (assuming a universal function class and appropriate regularization), are in fact consistent for bipartite ranking; moreover, our results allow us to quantify the bipartite ranking regret in terms of the corresponding surrogate regret. We also obtain tighter surrogate bounds under certain low-noise conditions via a recent result of Clemencon and Robbiano (2011).

Optimal values of bipartite entanglement in a tripartite system

For a general tripartite system in some pure state, an observer possessing any two parts will see them in a mixed state. By the consequence of Hughston-Jozsa-Wootters theorem, each basis set of local measurement on the third part will correspond to a particular decomposition of the bipartite mixed state into a weighted sum of pure states. It is possible to associate an average bipartite entanglement ((S) over bar) with each of these decompositions. The maximum value of (S) over bar is called the entanglement of assistance (E-A) while the minimum value is called the entanglement of formation (E-F). An appropriate choice of the basis set of local measurement will correspond to an optimal value of (S) over bar; we find here a generic optimality condition for the choice of the basis set. In the present context, we analyze the tripartite states W and GHZ and show how they are fundamentally different. (C) 2014 Elsevier B.V. All rights reserved.

Geometric phase of a bipartite system with Dzyaloshinski-Moriya interaction

The Berry phase of a bipartite system described by a Heisenberg XXZ model driven by a one-site magnetic field is investigated. The effect of the Dzyaloshinski-Moriya (DM) anisotropic interaction on the Berry phase is discussed. It is found that the DM interaction affects the Berry phase monotonously. and can also cause sudden change of the Berry phase for some weak magnetic field cases. (c) 2008 Elsevier B.V. All rights reserved.

Disentanglement of two qubits coupled to an XY spin chain: Role of quantum phase transition

We study the disentanglement evolution of two spin qubits which interact with a general XY spin-chain environment. The dynamical process of the disentanglement is numerically and analytically investigated in the vicinity of a quantum phase transition (QPT) of the spin chain in both weak and strong coupling cases. We find that the disentanglement of the two spin qubits may be greatly enhanced by the quantum critical behavior of the environmental spin chain. We give a detailed analysis to facilitate the understanding of the QPT-enhanced decaying behavior of the coherence factor. Furthermore, the scaling behavior in the disentanglement dynamics is also revealed and analyzed.

Decoherence of two Josephson charge qubits coupled via sigma(x)sigma(x)-type coupling and exposed to sigma(x) noise

Decoherence properties of two Josephson charge qubits coupled via the sigma(x)sigma(x) type are investigated. Considering the special structure of this new design, the dissipative effects arising from the circuit impedance providing the fluxes for the qubits' superconducting quantum interference device loops coupled to the sigma(x) qubit variables are considered. The results show that the overall decoherence effects are significantly strong in this qubit design. It is found that the dissipative effects are stronger in the case of coupling to two uncorrelated baths than are found in the case of one common bath.

Electronic structure of self-assembled InAs quantum discs in a magnetic field with varying orientation and two-electron quantum-disc qubits

We have studied the electronic structure of vertically assembled quantum discs in a magnetic field with varying orientation using the effective mass approximation. We calculate the four energy levels of single-electron quantum discs and the two lowest energy levels of two-electron quantum discs in a magnetic field with varying orientation. The change of the magnetic field as an effective potential strongly modifies the electronic structure, leading to splittings of the levels and anticrossings between the levels. The calculated results also demonstrate the switching between the ground states with the total spin S = 0 and 1. The switching induces a qubit controlled by varying the orientation of the magnetic field.

Quantum information processing with superconducting qubits in a microwave field

We investigate the quantum dynamics of a Cooper-pair box with a superconducting loop in the presence of a nonclassical microwave field. We demonstrate the existence of Rabi oscillations for both single- and multiphoton processes and, moreover, we propose a new quantum computing scheme (including one-bit and conditional two-bit gates) based on Josephson qubits coupled through microwaves.