Analytical Continuation Approaches to Electronic Transport: The Resonant Level Model

The analytical continuation average spectrum method (ASM) and maximum entropy (MaxEnt) method are applied to the dynamic response of a noninteracting resonant level model within the framework of the Kubo formula for electric conductivity. The frequency dependent conductivity is inferred from the imaginary time current-current correlation function for a wide range of temperatures, gate voltages and spectral densities representing the leads, and compared with exact results. We find that the MaxEnt provides more accurate results compared to the ASM over the full spectral range.Comment: 6 pages, 5 figure

A Spectral CT Method to Directly Estimate Basis Material Maps From Experimental Photon-Counting Data

The proposed spectral CT method solves the constrained one-step spectral CT reconstruction (cOSSCIR) optimization problem to estimate basis material maps while modeling the nonlinear X-ray detection process and enforcing convex constraints on the basis map images. In order to apply the optimization-based reconstruction approach to experimental data, the presented method empirically estimates the effective energy-window spectra using a calibration procedure. The amplitudes of the estimated spectra were further optimized as part of the reconstruction process to reduce ring artifacts. A validation approach was developed to select constraint parameters. The proposed spectral CT method was evaluated through simulations and experiments with a photon-counting detector. Basis material map images were successfully reconstructed using the presented empirical spectral modeling and cOSSCIR optimization approach. In simulations, the cOSSCIR approach accurately reconstructed the basis map images

Semi-optimal Practicable Algorithmic Cooling

Algorithmic Cooling (AC) of spins applies entropy manipulation algorithms in open spin-systems in order to cool spins far beyond Shannon's entropy bound. AC of nuclear spins was demonstrated experimentally, and may contribute to nuclear magnetic resonance (NMR) spectroscopy. Several cooling algorithms were suggested in recent years, including practicable algorithmic cooling (PAC) and exhaustive AC. Practicable algorithms have simple implementations, yet their level of cooling is far from optimal; Exhaustive algorithms, on the other hand, cool much better, and some even reach (asymptotically) an optimal level of cooling, but they are not practicable. We introduce here semi-optimal practicable AC (SOPAC), wherein few cycles (typically 2-6) are performed at each recursive level. Two classes of SOPAC algorithms are proposed and analyzed. Both attain cooling levels significantly better than PAC, and are much more efficient than the exhaustive algorithms. The new algorithms are shown to bridge the gap between PAC and exhaustive AC. In addition, we calculated the number of spins required by SOPAC in order to purify qubits for quantum computation. As few as 12 and 7 spins are required (in an ideal scenario) to yield a mildly pure spin (60% polarized) from initial polarizations of 1% and 10%, respectively. In the latter case, about five more spins are sufficient to produce a highly pure spin (99.99% polarized), which could be relevant for fault-tolerant quantum computing.Comment: 13 pages, 5 figure

Wavelength-independent coupler from fiber to an on-chip cavity, demonstrated over an 850nm span

A robust wide band (850 nm) fiber coupler to a whispering-gallery cavity with ultra-high quality factor is experimentally demonstrated. The device trades off ideality for broad-band, efficient input coupling. Output coupling efficiency can remain high enough for practical applications wherein pumping and power extraction must occur over very broad wavelength spans

Transcription factor search for a DNA promoter in a three-states model

To ensure fast gene activation, Transcription Factors (TF) use a mechanism known as facilitated diffusion to find their DNA promoter site. Here we analyze such a process where a TF alternates between 3D and 1D diffusion. In the latter (TF bound to the DNA), the TF further switches between a fast translocation state dominated by interaction with the DNA backbone, and a slow examination state where interaction with DNA base pairs is predominant. We derive a new formula for the mean search time, and show that it is faster and less sensitive to the binding energy fluctuations compared to the case of a single sliding state. We find that for an optimal search, the time spent bound to the DNA is larger compared to the 3D time in the nucleus, in agreement with recent experimental data. Our results further suggest that modifying switching via phosphorylation or methylation of the TF or the DNA can efficiently regulate transcription.Comment: 4 pages, 3 figure

Quantum Detection with Unknown States

We address the problem of distinguishing among a finite collection of quantum states, when the states are not entirely known. For completely specified states, necessary and sufficient conditions on a quantum measurement minimizing the probability of a detection error have been derived. In this work, we assume that each of the states in our collection is a mixture of a known state and an unknown state. We investigate two criteria for optimality. The first is minimization of the worst-case probability of a detection error. For the second we assume a probability distribution on the unknown states, and minimize of the expected probability of a detection error. We find that under both criteria, the optimal detectors are equivalent to the optimal detectors of an ``effective ensemble''. In the worst-case, the effective ensemble is comprised of the known states with altered prior probabilities, and in the average case it is made up of altered states with the original prior probabilities.Comment: Refereed version. Improved numerical examples and figures. A few typos fixe

On the existence of 0/1 polytopes with high semidefinite extension complexity

In Rothvo\ss{} it was shown that there exists a 0/1 polytope (a polytope whose vertices are in \{0,1\}^{n}) such that any higher-dimensional polytope projecting to it must have 2^{\Omega(n)} facets, i.e., its linear extension complexity is exponential. The question whether there exists a 0/1 polytope with high PSD extension complexity was left open. We answer this question in the affirmative by showing that there is a 0/1 polytope such that any spectrahedron projecting to it must be the intersection of a semidefinite cone of dimension~2^{\Omega(n)} and an affine space. Our proof relies on a new technique to rescale semidefinite factorizations