Quantum Computing in Arrays Coupled by 'Always On' Interactions

It has recently been shown that one can perform quantum computation in a Heisenberg chain in which the interactions are 'always on', provided that one can abruptly tune the Zeeman energies of the individual (pseudo-)spins. Here we provide a more complete analysis of this scheme, including several generalizations. We generalize the interaction to an anisotropic form (incorporating the XY, or Forster, interaction as a limit), providing a proof that a chain coupled in this fashion tends to an effective Ising chain in the limit of far off-resonant spins. We derive the primitive two-qubit gate that results from exploiting abrupt Zeeman tuning with such an interaction. We also demonstrate, via numerical simulation, that the same basic scheme functions in the case of smoothly shifted Zeeman energies. We conclude with some remarks regarding generalisations to two- and three-dimensional arrays.Comment: 16 pages (preprint format) inc. 3 figure

Spin systems with dimerized ground states

In view of the numerous examples in the literature it is attempted to outline a theory of Heisenberg spin systems possessing dimerized ground states (``DGS systems") which comprises all known examples. Whereas classical DGS systems can be completely characterized, it was only possible to provide necessary or sufficient conditions for the quantum case. First, for all DGS systems the interaction between the dimers must be balanced in a certain sense. Moreover, one can identify four special classes of DGS systems: (i) Uniform pyramids, (ii) systems close to isolated dimer systems, (iii) classical DGS systems, and (iv), in the case of $s=1/2$, systems of two dimers satisfying four inequalities. Geometrically, the set of all DGS systems may be visualized as a convex cone in the linear space of all exchange constants. Hence one can generate new examples of DGS systems by positive linear combinations of examples from the above four classes.Comment: With corrections of proposition 4 and other minor change

Spanning Properties of Theta-Theta Graphs

We study the spanning properties of Theta-Theta graphs. Similar in spirit with the Yao-Yao graphs, Theta-Theta graphs partition the space around each vertex into a set of k cones, for some fixed integer k > 1, and select at most one edge per cone. The difference is in the way edges are selected. Yao-Yao graphs select an edge of minimum length, whereas Theta-Theta graphs select an edge of minimum orthogonal projection onto the cone bisector. It has been established that the Yao-Yao graphs with parameter k = 6k' have spanning ratio 11.67, for k' >= 6. In this paper we establish a first spanning ratio of $7.82$ for Theta-Theta graphs, for the same values of $k$. We also extend the class of Theta-Theta spanners with parameter 6k', and establish a spanning ratio of $16.76$ for k' >= 5. We surmise that these stronger results are mainly due to a tighter analysis in this paper, rather than Theta-Theta being superior to Yao-Yao as a spanner. We also show that the spanning ratio of Theta-Theta graphs decreases to 4.64 as k' increases to 8. These are the first results on the spanning properties of Theta-Theta graphs.Comment: 20 pages, 6 figures, 3 table

Estimation of geopotential from satellite-to-satellite range rate data: Numerical results

A technique for high-resolution geopotential field estimation by recovering the harmonic coefficients from satellite-to-satellite range rate data is presented and tested against both a controlled analytical simulation of a one-day satellite mission (maximum degree and order 8) and then against a Cowell method simulation of a 32-day mission (maximum degree and order 180). Innovations include: (1) a new frequency-domain observation equation based on kinetic energy perturbations which avoids much of the complication of the usual Keplerian element perturbation approaches; (2) a new method for computing the normalized inclination functions which unlike previous methods is both efficient and numerically stable even for large harmonic degrees and orders; (3) the application of a mass storage FFT to the entire mission range rate history; (4) the exploitation of newly discovered symmetries in the block diagonal observation matrix which reduce each block to the product of (a) a real diagonal matrix factor, (b) a real trapezoidal factor with half the number of rows as before, and (c) a complex diagonal factor; (5) a block-by-block least-squares solution of the observation equation by means of a custom-designed Givens orthogonal rotation method which is both numerically stable and tailored to the trapezoidal matrix structure for fast execution

Upward Point-Set Embeddability

We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph $D$ has an upward planar embedding into a point set $S$. We show that any switch tree admits an upward planar straight-line embedding into any convex point set. For the class of $k$-switch trees, that is a generalization of switch trees (according to this definition a switch tree is a $1$-switch tree), we show that not every $k$-switch tree admits an upward planar straight-line embedding into any convex point set, for any $k \geq 2$. Finally we show that the problem of Upward Point-Set Embeddability is NP-complete

Multi-Qubit Gates in Arrays Coupled by 'Always On' Interactions

Recently there has been interest in the idea of quantum computing without control of the physical interactions between component qubits. This is highly appealing since the 'switching' of such interactions is a principal difficulty in creating real devices. It has been established that one can employ 'always on' interactions in a one-dimensional Heisenberg chain, provided that one can tune the Zeeman energies of the individual (pseudo-)spins. It is important to generalize this scheme to higher dimensional networks, since a real device would probably be of that kind. Such generalisations have been proposed, but only at the severe cost that the efficiency of qubit storage must *fall*. Here we propose the use of multi-qubit gates within such higher-dimensional arrays, finding a novel three-qubit gate that can in fact increase the efficiency beyond the linear model. Thus we are able to propose higher dimensional networks that can constitute a better embodiment of the 'always on' concept - a substantial step toward bringing this novel concept to full fruition.Comment: 20 pages in preprint format, inc. 3 figures. This version has fixed typos and printer-friendly figures, and is to appear in NJ

Optoelectronics of Inverted Type-I CdS/CdSe Core/Crown Quantum Ring

Inverted type-I heterostructure core/crown quantum rings (QRs) are quantum-efficient luminophores, whose spectral characteristics are highly tunable. Here, we study the optoelectronic properties of type-I core/crown CdS/CdSe QRs in the zincblende phase - over contrasting lateral size and crown width. For this we inspect their strain profiles, transition energies, transition matrix elements, spatial charge densities, electronic bandstructure, band-mixing probabilities, optical gain spectra, maximum optical gains and differential optical gains. Our framework uses an effective-mass envelope function theory based on the 8-band k$\cdot$p method employing the valence force field model for calculating the atomic strain distributions. The gain calculations are based on the density-matrix equation and take into consideration the excitonic effects with intraband scattering. Variations in the QR lateral size and relative widths of core and crown (ergo the composition) affect their energy levels, band-mixing probabilities, optical transition matrix elements, emission wavelengths/intensity, etc. The optical gain of QRs is also strongly dimension and composition dependent with further dependency on the injection carrier density causing band-filling effect. They also affect the maximum and differential gain at varying dimensions and compositions.Comment: Published in AIP Journal of Applied Physics (11 pages, 7 figures

Multibaseline gravitational wave radiometry

We present a statistic for the detection of stochastic gravitational wave backgrounds (SGWBs) using radiometry with a network of multiple baselines. We also quantitatively compare the sensitivities of existing baselines and their network to SGWBs. We assess how the measurement accuracy of signal parameters, e.g., the sky position of a localized source, can improve when using a network of baselines, as compared to any of the single participating baselines. The search statistic itself is derived from the likelihood ratio of the cross correlation of the data across all possible baselines in a detector network and is optimal in Gaussian noise. Specifically, it is the likelihood ratio maximized over the strength of the SGWB, and is called the maximized-likelihood ratio (MLR). One of the main advantages of using the MLR over past search strategies for inferring the presence or absence of a signal is that the former does not require the deconvolution of the cross correlation statistic. Therefore, it does not suffer from errors inherent to the deconvolution procedure and is especially useful for detecting weak sources. In the limit of a single baseline, it reduces to the detection statistic studied by Ballmer [Class. Quant. Grav. 23, S179 (2006)] and Mitra et al. [Phys. Rev. D 77, 042002 (2008)]. Unlike past studies, here the MLR statistic enables us to compare quantitatively the performances of a variety of baselines searching for a SGWB signal in (simulated) data. Although we use simulated noise and SGWB signals for making these comparisons, our method can be straightforwardly applied on real data.Comment: 17 pages and 19 figure

Quantum Energy Teleportation in Spin Chain Systems

We propose a protocol for quantum energy teleportation which transports energy in spin chains to distant sites only by local operations and classical communication. By utilizing ground-state entanglement and notion of negative energy density region, energy is teleported without breaking any physical laws including causality and local energy conservation. Because not excited physical entity but classical information is transported in the protocol, the dissipation rate of energy in transport is expected to be strongly suppressed.Comment: 22 pages, 4 figure, to be published in JPS