Distinguishing n Hamiltonians on C^n by a single measurement

If an experimentalist wants to decide which one of n possible Hamiltonians acting on an n dimensional Hilbert space is present, he can conjugate the time evolution by an appropriate sequence of known unitary transformations in such a way that the different Hamiltonians result in mutual orthogonal final states. We present a general scheme providing such a sequence.Comment: 4 pages, Revte

Noise resistance of adiabatic quantum computation using random matrix theory

Besides the traditional circuit-based model of quantum computation, several quantum algorithms based on a continuous-time Hamiltonian evolution have recently been introduced, including for instance continuous-time quantum walk algorithms as well as adiabatic quantum algorithms. Unfortunately, very little is known today on the behavior of these Hamiltonian algorithms in the presence of noise. Here, we perform a fully analytical study of the resistance to noise of these algorithms using perturbation theory combined with a theoretical noise model based on random matrices drawn from the Gaussian Orthogonal Ensemble, whose elements vary in time and form a stationary random process.Comment: 9 pages, 3 figure

Decoherence and Quantum Walks: anomalous diffusion and ballistic tails

The common perception is that strong coupling to the environment will always render the evolution of the system density matrix quasi-classical (in fact, diffusive) in the long time limit. We present here a counter-example, in which a particle makes quantum transitions between the sites of a d-dimensional hypercubic lattice whilst strongly coupled to a bath of two-level systems which 'record' the transitions. The long-time evolution of an initial wave packet is found to be most unusual: the mean square displacement of the particle density matrix shows long-range ballitic behaviour, but simultaneously a kind of weakly-localised behaviour near the origin. This result may have important implications for the design of quantum computing algorithms, since it describes a class of quantum walks.Comment: 4 pages, 1 figur

Architectures for a quantum random access memory

A random access memory, or RAM, is a device that, when interrogated, returns the content of a memory location in a memory array. A quantum RAM, or qRAM, allows one to access superpositions of memory sites, which may contain either quantum or classical information. RAMs and qRAMs with n-bit addresses can access 2^n memory sites. Any design for a RAM or qRAM then requires O(2^n) two-bit logic gates. At first sight this requirement might seem to make large scale quantum versions of such devices impractical, due to the difficulty of constructing and operating coherent devices with large numbers of quantum logic gates. Here we analyze two different RAM architectures (the conventional fanout and the "bucket brigade") and propose some proof-of-principle implementations which show that in principle only O(n) two-qubit physical interactions need take place during each qRAM call. That is, although a qRAM needs O(2^n) quantum logic gates, only O(n) need to be activated during a memory call. The resulting decrease in resources could give rise to the construction of large qRAMs that could operate without the need for extensive quantum error correction.Comment: 10 pages, 7 figures. Updated version includes the answers to the Refere

Scaling of running time of quantum adiabatic algorithm for propositional satisfiability

We numerically study quantum adiabatic algorithm for the propositional satisfiability. A new class of previously unknown hard instances is identified among random problems. We numerically find that the running time for such instances grows exponentially with their size. Worst case complexity of quantum adiabatic algorithm therefore seems to be exponential.Comment: 7 page

Enhanced Spontaneous Emission Into The Mode Of A Cavity QED System

We study the light generated by spontaneous emission into a mode of a cavity QED system under weak excitation of the orthogonally polarized mode. Operating in the intermediate regime of cavity QED with comparable coherent and decoherent coupling constants, we find an enhancement of the emission into the undriven cavity mode by more than a factor of 18.5 over that expected by the solid angle subtended by the mode. A model that incorporates three atomic levels and two polarization modes quantitatively explains the observations.Comment: 9 pages, 2 figures, to appear in May 2007 Optics Letter

Contextuality in Measurement-based Quantum Computation

We show, under natural assumptions for qubit systems, that measurement-based quantum computations (MBQCs) which compute a non-linear Boolean function with high probability are contextual. The class of contextual MBQCs includes an example which is of practical interest and has a super-polynomial speedup over the best known classical algorithm, namely the quantum algorithm that solves the Discrete Log problem.Comment: Version 3: probabilistic version of Theorem 1 adde

Distribution of chirality in the quantum walk: Markov process and entanglement

The asymptotic behavior of the quantum walk on the line is investigated focusing on the probability distribution of chirality independently of position. The long-time limit of this distribution is shown to exist and to depend on the initial conditions, and it also determines the asymptotic value of the entanglement between the coin and the position. It is shown that for given asymptotic values of both the entanglement and the chirality distribution it is possible to find the corresponding initial conditions within a particular class of spatially extended Gaussian distributions. Moreover it is shown that the entanglement also measures the degree of Markovian randomness of the distribution of chirality.Comment: 5 pages, 3 figures, It was accepted in Physcial Review

Feminizing political parties: women’s party member organizations within European parliamentary parties

Party member women’s organizations were early features of party development. While some contemporary studies maintain these are important sites for the substantive representation of women, there is also a claim that they are in decline. Our primary purpose here is to establish the existence of party member women’s organizations – as one test of the first dimension of party feminization: the inclusion of women. We draw on new survey data of 17 European countries provided by Scarrow, Poguntke and Webb. We establish that almost half have a party member women’s organization. The new data also permits analysis of relationships between party member women’s organization and gender quotas for the top party leadership body (National Executive Committee (NEC)), women’s presence among the party leadership and candidate quota rules. Together we see these (i) as a means to establish whether women are marginalized within the party, thereby limiting descriptive representation and (ii) as surrogate measures for women’s substantive representation. We importantly find that the presence of a party member women’s organization does not come at the cost of women’s presence on the NEC. In the final section, we turn our attention to building a new comparative research agenda that more fully addresses substantive representation

A knowledge-based ideation approach for bio-inspired design

Bio-inspired design (BID) involves generating innovative ideas for engineering design by drawing inspiration from natural biological phenomena and systems, using a form of design-by-analogy. Despite its many successes, BID approaches encounter research challenges including unstructured data and existing models that hinder comprehension and processing, limited focus on finding biological knowledge compared to defined problems, and insufficient guidance of the ideation process with algorithms. This paper proposes a knowledge-based approach to address the challenges. The approach involves transforming unstructured data into structured knowledge, including information about natural sources, their benefits, and applications. The structured knowledge is then used to construct a semantic network, enabling designers to retrieve information for BID in two ways. Furthermore, a three-step ideation method is developed to encourage divergent thinking and explore additional potential solutions by drawing inspiration and utilizing knowledge. The knowledge-based BID approach is implemented as a tool and design cases are conducted to illustrate the process of applying this tool for BID