Geometric programming prediction of design trends for OMV protective structures

The global optimization trends of protective honeycomb structural designs for spacecraft subject to hypervelocity meteroid and space debris are presented. This nonlinear problem is first formulated for weight minimization of the orbital maneuvering vehicle (OMV) using a generic monomial predictor. Five problem formulations are considered, each dependent on the selection of independent design variables. Each case is optimized by considering the dual geometric programming problem. The dual variables are solved for in terms of the generic estimated exponents of the monomial predictor. The primal variables are then solved for by conversion. Finally, parametric design trends are developed for ranges of the estimated regression parameters. Results specify nonmonotonic relationships for the optimal first and second sheet mass per unit areas in terms of the estimated exponents

Optimal state encoding for quantum walks and quantum communication over spin systems

Recent work has shown that a simple chain of interacting spins can be used as a medium for high-fidelity quantum communication. We describe a scheme for quantum communication using a spin system that conserves z-spin, but otherwise is arbitrary. The sender and receiver are assumed to directly control several spins each, with the sender encoding the message state onto the larger state-space of her control spins. We show how to find the encoding that maximises the fidelity of communication, using a simple method based on the singular-value decomposition. Also, we show that this solution can be used to increase communication fidelity in a rather different circumstance: where no encoding of initial states is used, but where the sender and receiver control exactly two spins each and vary the interactions on those spins over time. The methods presented are computationally efficient, and numerical examples are given for systems having up to 300 spins.Comment: 10 pages, LaTeX, 7 EPS figures. Corrected an error in the definition and interpretation of C_B(T

Connecting N-representability to Weyl's problem: The one particle density matrix for N = 3 and R = 6

An analytic proof is given of the necessity of the Borland-Dennis conditions for 3-representability of a one particle density matrix with rank 6. This may shed some light on Klyachko's recent use of Schubert calculus to find general conditions for N-representability

Better bound on the exponent of the radius of the multipartite separable ball

We show that for an m-qubit quantum system, there is a ball of radius asymptotically approaching kappa 2^{-gamma m} in Frobenius norm, centered at the identity matrix, of separable (unentangled) positive semidefinite matrices, for an exponent gamma = (1/2)((ln 3/ln 2) - 1), roughly .29248125. This is much smaller in magnitude than the best previously known exponent, from our earlier work, of 1/2. For normalized m-qubit states, we get a separable ball of radius sqrt(3^(m+1)/(3^m+3)) * 2^{-(1 + \gamma)m}, i.e. sqrt{3^{m+1}/(3^m+3)}\times 6^{-m/2} (note that \kappa = \sqrt{3}), compared to the previous 2 * 2^{-3m/2}. This implies that with parameters realistic for current experiments, NMR with standard pseudopure-state preparation techniques can access only unentangled states if 36 qubits or fewer are used (compared to 23 qubits via our earlier results). We also obtain an improved exponent for m-partite systems of fixed local dimension d_0, although approaching our earlier exponent as d_0 approaches infinity.Comment: 30 pp doublespaced, latex/revtex, v2 added discussion of Szarek's upper bound, and reference to work of Vidal, v3 fixed some errors (no effect on results), v4 involves major changes leading to an improved constant, same exponent, and adds references to and discussion of Szarek's work showing that exponent is essentially optimal for qubit case, and Hildebrand's alternative derivation for qubit case. To appear in PR

Theory of impedance networks: The two-point impedance and LC resonances

We present a formulation of the determination of the impedance between any two nodes in an impedance network. An impedance network is described by its Laplacian matrix L which has generally complex matrix elements. We show that by solving the equation L u_a = lambda_a u_a^* with orthonormal vectors u_a, the effective impedance between nodes p and q of the network is Z = Sum_a [u_{a,p} - u_{a,q}]^2/lambda_a where the summation is over all lambda_a not identically equal to zero and u_{a,p} is the p-th component of u_a. For networks consisting of inductances (L) and capacitances (C), the formulation leads to the occurrence of resonances at frequencies associated with the vanishing of lambda_a. This curious result suggests the possibility of practical applications to resonant circuits. Our formulation is illustrated by explicit examples.Comment: 21 pages, 3 figures; v4: typesetting corrected; v5: Eq. (63) correcte

Potential Errors in a Scheme of Universal Quantum Gates in Kane's Model

We re--investigate a plausible proposal for universal quantum gates in Kane's model, in which the authors assumed that electron spin is always downward under a background magnetic field and the value of controlling parameters is varied instantaneously. We demonstrate that a considerable error appears, for example, in the X rotation. As result, the controlled operations don't work. Such a failure is caused by improper choice of the computational bases; actually, the electron spin is not always downward over time during quantum operations.Comment: 11 pages, 3 figures; improved with typos corrected; Accepted for publication in Phys. Rev.

StemNet: An Evolving Service for Knowledge Networking in the Life Sciences

Up until now, crucial life science information resources, whether bibliographic or factual databases, are isolated from each other. Moreover, semantic metadata intended to structure their contents is supplied in a manual form only. In the StemNet project we aim at developing a framework for semantic interoperability for these resources. This will facilitate the extraction of relevant information from textual sources and the generation of semantic metadata in a fully automatic manner. In this way, (from a computational perspective) unstructured life science documents are linked to structured biological fact databases, in particular to the identifiers of genes, proteins, etc. Thus, life scientists will be able to seamlessly access information from a homogeneous platform, despite the fact that the original information was unlinked and scattered over the whole variety of heterogeneous life science information resources and, therefore, almost inaccessible for integrated systematic search by academic, clinical, or industrial users

Quantum equilibration in finite time

It has recently been shown that small quantum subsystems generically equilibrate, in the sense that they spend most of the time close to a fixed equilibrium state. This relies on just two assumptions: that the state is spread over many different energies, and that the Hamiltonian has non-degenerate energy gaps. Given the same assumptions, it has also been shown that closed systems equilibrate with respect to realistic measurements. We extend these results in two important ways. First, we prove equilibration over a finite (rather than infinite) time-interval, allowing us to bound the equilibration time. Second, we weaken the non degenerate energy gaps condition, showing that equilibration occurs provided that no energy gap is hugely degenerate.Comment: 7 page

Quantum quench dynamics of the Bose-Hubbard model at finite temperatures

We study quench dynamics of the Bose-Hubbard model by exact diagonalization. Initially the system is at thermal equilibrium and of a finite temperature. The system is then quenched by changing the on-site interaction strength $U$ suddenly. Both the single-quench and double-quench scenarios are considered. In the former case, the time-averaged density matrix and the real-time evolution are investigated. It is found that though the system thermalizes only in a very narrow range of the quenched value of $U$, it does equilibrate or relax well in a much larger range. Most importantly, it is proven that this is guaranteed for some typical observables in the thermodynamic limit. In order to test whether it is possible to distinguish the unitarily evolving density matrix from the time-averaged (thus time-independent), fully decoherenced density matrix, a second quench is considered. It turns out that the answer is affirmative or negative according to the intermediate value of $U$ is zero or not.Comment: preprint, 20 pages, 7 figure

Entanglement frustration for Gaussian states on symmetric graphs

We investigate the entanglement properties of multi-mode Gaussian states, which have some symmetry with respect to the ordering of the modes. We show how the symmetry constraints the entanglement between two modes of the system. In particular, we determine the maximal entanglement of formation that can be achieved in symmetric graphs like chains, 2d and 3d lattices, mean field models and the platonic solids. The maximal entanglement is always attained for the ground state of a particular quadratic Hamiltonian. The latter thus yields the maximal entanglement among all quadratic Hamiltonians having the considered symmetry.Comment: 5 pages, 1 figur