activity
19932026
most citedd-Dimensional Black Hole Entropy Spectrum from Quasi-Normal Modes

279 citations · 2.5k across the 99 of their papers we have counts for

collaborators
Showing quant-phShow all

11 papers · 1 filter

quant-ph2020★ 2 cited

Escape from the Quantum Pigeon Conundrum

Gabor Kunstatter, Jonathan Ziprick, Victoria McNab +3

It has recently been argued in Aharonov et. al. (2016) that quantum mechanics violates the Pigeon Counting Principle (PCP) which states that if one distributes three pigeons among…

quant-ph2010★ 3 cited

Geometric measures of entanglement and the Schmidt decomposition

M. E. Carrington, R. Kobes, G. Kunstatter +2

In the standard geometric approach, the entanglement of a pure state is , where is the angle between the entangled state and the closest separable state of products of…

quant-ph2007

Geometric measures of entanglement and the Schmidt decomposition

D. Ostapchuk, G. Passante, R. Kobes +1

In the standard geometric approach to a measure of entanglement of a pure state, is used, where is the angle between the state to the closest separable state of produ…

quant-ph2007

Decoherence of a Single Qubit from Quantum Anomaly

W. F. Chen, R. Kobes, G. Kunstatter

We show via an explicit example that quantum anomalies can lead to decoherence of a single quantum qubit through phase relaxation. The anomaly causes the Hamiltonian to develop a n…

quant-ph2006★ 2 cited

The Dynamics of Entanglement in the Adiabatic Search and Deutsch Algorithms

K. Choy, G. Passante, D. Ahrensmeier +4

The goal of this paper is to study the effect of entanglement on the running time of a quantum computation. Adiabatic quantum computation is suited to this kind of study, since it…

quant-ph2003

A new adiabatic quantum search algorithm

H. Zaraket, V. Bagnulo, J. Kettner +2

We present a new adiabatic quantum algorithm for searching over structured databases. The new algorithm is optimized using a simplified complexity analysis.

quant-ph2002★ 1 cited

Rapid Data Search using Adiabatic Quantum Computation

Daria Ahrensmeier, Saurya Das, Randy Kobes +2

We show that by a suitable choice of time-dependent Hamiltonian, the search for a marked item in an unstructured database can be achieved in unit time, using Adiabatic Quantum Comp…

quant-ph2002★ 2 cited

Structured Adiabatic Quantum Search

Daria Ahrensmeier, Saurya Das, Randy Kobes +2

We examine the use of adiabatic quantum algorithms to solve structured, or nested, search problems. We construct suitable time dependent Hamiltonians and derive the computation tim…

quant-ph2002★ 34 cited

Energy and Efficiency of Adiabatic Quantum Search Algorithms

Saurya Das, Randy Kobes, Gabor Kunstatter

We present the results of a detailed analysis of a general, unstructured adiabatic quantum search of a data base of items. In particular we examine the effects on the computati…

quant-ph2001★ 49 cited

Adiabatic Quantum Computation and Deutsch's Algorithm

Saurya Das, Randy Kobes, Gabor Kunstatter

We show that by a suitable choice of a time dependent Hamiltonian, Deutsch's algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jo…

quant-ph1997

The Effective Action for a Relativistic Jaynes-Cummings Model

Mark Burgess, Margaret Carrington, Gabor Kunstatter

We describe an effective field theory for atomic lasers which reduces to the Jaynes-Cummings model in the non-relativistic, single mode limit. Our action describes a multi-mode sys…