Noncommutative geometrical structures of entangled quantum states

We study the noncommutative geometrical structures of quantum entangled states. We show that the space of a pure entangled state is a noncommutative space. In particular we show that by rewritten the conifold or the Segre variety we can get a $q$-deformed relation in noncommutative geometry. We generalized our construction into a multi-qubit state. We also in detail discuss the noncommutative geometrical structure of a three-qubit state.Comment: 7 page

Optimal Eavesdropping in Quantum Cryptography. II. Quantum Circuit

It is shown that the optimum strategy of the eavesdropper, as described in the preceding paper, can be expressed in terms of a quantum circuit in a way which makes it obvious why certain parameters take on particular values, and why obtaining information in one basis gives rise to noise in the conjugate basis.Comment: 7 pages, 1 figure, Latex, the second part of quant-ph/970103

The operation of two decarboxylases, transamination, and partitioning of C4 metabolic processes between mesophyll and bundle sheath cells allows light capture to be balanced for the maize C4 pathway.

The C4 photosynthesis carbon-concentrating mechanism in maize (Zea mays) has two CO2 delivery pathways to the bundle sheath (BS; via malate or aspartate), and rates of phosphoglyceric acid reduction, starch synthesis, and phosphoenolpyruvate regeneration also vary between BS and mesophyll (M) cells. The theoretical partitioning of ATP supply between M and BS cells was derived for these metabolic activities from simulated profiles of light penetration across a leaf, with a potential 3-fold difference in the fraction of ATP produced in the BS relative to M (from 0.29 to 0.96). A steady-state metabolic model was tested using varying light quality to differentially stimulate M or BS photosystems. CO2 uptake, ATP production rate (JATP; derived with a low oxygen/chlorophyll fluorescence method), and carbon isotope discrimination were measured on plants under a low light intensity, which is considered to affect C4 operating efficiency. The light quality treatments did not change the empirical ATP cost of gross CO2 assimilation (JATP/GA). Using the metabolic model, measured JATP/GA was compared with the predicted ATP demand as metabolic functions were varied between M and BS. Transamination and the two decarboxylase systems (NADP-malic enzyme and phosphoenolpyruvate carboxykinase) were critical for matching ATP and reduced NADP demand in BS and M when light capture was varied under contrasting light qualities

Dynamical approach study of spurious steady-state numerical solutions of nonlinear differential equations. Part 1: The ODE connection and its implications for algorithm development in computational fluid dynamics

Spurious stable as well as unstable steady state numerical solutions, spurious asymptotic numerical solutions of higher period, and even stable chaotic behavior can occur when finite difference methods are used to solve nonlinear differential equations (DE) numerically. The occurrence of spurious asymptotes is independent of whether the DE possesses a unique steady state or has additional periodic solutions and/or exhibits chaotic phenomena. The form of the nonlinear DEs and the type of numerical schemes are the determining factor. In addition, the occurrence of spurious steady states is not restricted to the time steps that are beyond the linearized stability limit of the scheme. In many instances, it can occur below the linearized stability limit. Therefore, it is essential for practitioners in computational sciences to be knowledgeable about the dynamical behavior of finite difference methods for nonlinear scalar DEs before the actual application of these methods to practical computations. It is also important to change the traditional way of thinking and practices when dealing with genuinely nonlinear problems. In the past, spurious asymptotes were observed in numerical computations but tended to be ignored because they all were assumed to lie beyond the linearized stability limits of the time step parameter delta t. As can be seen from the study, bifurcations to and from spurious asymptotic solutions and transitions to computational instability not only are highly scheme dependent and problem dependent, but also initial data and boundary condition dependent, and not limited to time steps that are beyond the linearized stability limit

On spurious steady-state solutions of explicit Runge-Kutta schemes

The bifurcation diagram associated with the logistic equation v sup n+1 = av sup n (1-v sup n) is by now well known, as is its equivalence to solving the ordinary differential equation u prime = alpha u (1-u) by the explicit Euler difference scheme. It has also been noted by Iserles that other popular difference schemes may not only exhibit period doubling and chaotic phenomena but also possess spurious fixed points. Runge-Kutta schemes applied to both the equation u prime = alpha u (1-u) and the cubic equation u prime = alpha u (1-u)(b-u) were studied computationally and analytically and their behavior was contrasted with the explicit Euler scheme. Their spurious fixed points and periodic orbits were noted. In particular, it was observed that these may appear below the linearized stability limits of the scheme and, consequently, computation may lead to erroneous results

From Classical State-Swapping to Quantum Teleportation

The quantum teleportation protocol is extracted directly out of a standard classical circuit that exchanges the states of two qubits using only controlled-NOT gates. This construction of teleportation from a classically transparent circuit generalizes straightforwardly to d-state systems.Comment: Missing daggers added to Figures 13, 14, and 15. Otherwise this is the version that appeared in Physical Revie

Topological quantum gate entangler for a multi-qubit state

We establish a relation between topological and quantum entanglement for a multi-qubit state by considering the unitary representations of the Artin braid group. We construct topological operators that can entangle multi-qubit state. In particular we construct operators that create quantum entanglement for multi-qubit states based on the Segre ideal of complex multi-projective space. We also in detail discuss and construct these operators for two-qubit and three-qubit states.Comment: 6 page

Measurement Invariance of the Internet Addiction Test Among Hong Kong, Japanese, and Malaysian Adolescents

There has been increased research examining the psychometric properties on the Internet Addiction Test across different ages and populations. This population-based study examined the psychometric properties using Confirmatory Factory Analysis and measurement invariance using Item Response Theory (IRT) of the IAT in adolescents from three Asian countries. In the Asian Adolescent Risk Behavior Survey (AARBS), 2,535 secondary school students (55.91% girls) in Grade 7 to Grade 13 (Mean age = 15.61 years; SD=1.56) from Hong Kong (n=844), Japan (n=744), and Malaysia (n=947) completed a survey on their Internet use that incorporated the IAT scale. A nested hierarchy of hypotheses concerning IAT cross-country invariance was tested using multi-group confirmatory factor analysis. Replicating past finding in Hong Kong adolescents, the construct of IAT is best represented by a second-order three-factor structure in Malaysian and Japanese adolescents. Configural, metric, scalar, and partial strict factorial invariance was established across the three samples. No cross-country differences on Internet addiction were detected at latent mean level. This study provided empirical support to the IAT as a reliable and factorially stable instrument, and valid to be used across Asian adolescent populations

Object Matching in Distributed Video Surveillance Systems by LDA-Based Appearance Descriptors

Establishing correspondences among object instances is still challenging in multi-camera surveillance systems, especially when the cameras’ fields of view are non-overlapping. Spatiotemporal constraints can help in solving the correspondence problem but still leave a wide margin of uncertainty. One way to reduce this uncertainty is to use appearance information about the moving objects in the site. In this paper we present the preliminary results of a new method that can capture salient appearance characteristics at each camera node in the network. A Latent Dirichlet Allocation (LDA) model is created and maintained at each node in the camera network. Each object is encoded in terms of the LDA bag-of-words model for appearance. The encoded appearance is then used to establish probable matching across cameras. Preliminary experiments are conducted on a dataset of 20 individuals and comparison against Madden’s I-MCHR is reported