Classical computation with quantum systems

As semiconductor electronic devices scale to the nanometer range and quantum structures (molecules, fullerenes, quantum dots, nanotubes) are investigated for use in information processing and storage, it, becomes useful to explore the limits imposed by quantum mechanics on classical computing. To formulate the problem of a quantum mechanical description of classical computing, electronic device and logic gates are described as quantum sub-systems with inputs treated as boundary conditions, outputs expressed.is operator expectation values, and transfer characteristics and logic operations expressed through the sub-system Hamiltonian. with constraints appropriate to the boundary conditions. This approach, naturally, leads to a description of the subsystem.,, in terms of density matrices. Application of the maximum entropy principle subject to the boundary conditions (inputs) allows for the determination of the density matrix (logic operation), and for calculation of expectation values of operators over a finite region (outputs). The method allows for in analysis of the static properties of quantum sub-systems.

Tools for analysing configuration interaction wavefunctions

The configuration interaction (CI) approach to quantum chemical calculations is a well-established means of calculating accurately the solution to the Schrodinger equation for many-electron systems. It represents the many-body electron wavefunction as a sum of spin-projected Slater determinants of orthogonal one-body spin-orbitals. The CI wavefunction becomes the exact solution of the Schrodinger equation as the length of the expansion becomes infinite, however, it is a difficult quantity to visualise and analyse for many-electron problems. We describe a method for efficiently calculating the spin-averaged one- and two-body reduced density matrices rho(psi)((r) over bar; (r) over bar' ) and Gamma(psi)((r) over bar (1), (r) over bar (2); (r) over bar'(1), (r) over bar'(2)) of an arbitrary CI wavefunction Psi. These low-dimensional functions are helpful tools for analysing many-body wavefunctions; we illustrate this for the case of the electron-electron cusp. From rho and Gamma one can calculate the matrix elements of any one- or two-body spin-free operator (O) over cap. For example, if (O) over cap is an applied electric field, this field can be included into the CI Hamiltonian and polarisation or gating effects may be studied for finite electron systems. (C) 2003 Elsevier B.V. All rights reserved.

Experimental Distribution of Entanglement with Separable Carriers

The key requirement for quantum networking is the distribution of entanglement between nodes. Surprisingly, entanglement can be generated across a network without direct transfer - or communication - of entanglement. In contrast to information gain, which cannot exceed the communicated information, the entanglement gain is bounded by the communicated quantum discord, a more general measure of quantum correlation that includes but is not limited to entanglement. Here, we experimentally entangle two communicating parties sharing three initially separable photonic qubits by exchange of a carrier photon that is unentangled with either party at all times. We show that distributing entanglement with separable carriers is resilient to noise and in some cases becomes the only way of distributing entanglement through noisy environments.

Dynamics of the entanglement spectrum in spin chains

We study the dynamics of the entanglement spectrum, that is the time evolution of the eigenvalues of the reduced density matrices after a bipartition of a one-dimensional spin chain. Starting from the ground state of an initial Hamiltonian, the state of the system is evolved in time with a new Hamiltonian. We consider both instantaneous and quasi adiabatic quenches of the system Hamiltonian across a quantum phase transition. We analyse the Ising model that can be exactly solved and the XXZ for which we employ the time-dependent density matrix renormalisation group algorithm. Our results show once more a connection between the Schmidt gap, i.e. the difference of the two largest eigenvalues of the reduced density matrix and order parameters, in this case the spontaneous magnetisation.

Distribution of the Demmel Condition Number of Wishart Matrices

This paper studies the Demmel condition number of Wishart matrices, a quantity which has numerous applications to wireless communications, such as adaptive switching between beamforming and diversity coding, link adaptation, and spectrum sensing. For complex Wishart matrices, we give an exact analytical expression for the probability density function (p.d.f.) of the Demmel condition number, and also derive simplified expressions for the high tail regime. These results indicate that the condition of complex Wishart matrices is dominantly decided by the difference between the matrix dimension and degree of freedom (DoF), i.e., the probability of drawing a highly ill conditioned matrix decreases considerably when the difference between the matrix dimension and DoF increases. We further investigate real Wishart matrices, and derive new expressions for the p.d.f. of the smallest eigenvalue, when the difference between the matrix dimension and DoF is odd. Based on these results, we succeed to obtain an exact p.d.f. expression for the Demmel condition number, and simplified expressions for the high tail regime.