Searcharxiv⌕ Search

arXiv subjects

Daniel S. Abrams

Publications and source records attributed to Daniel S. Abrams.

8 recordsLinked to original sources
arXiv2005

Eigenvalue Estimation of Differential Operators

We demonstrate how linear differential operators could be emulated by a quantum processor, should one ever be built, using the Abrams-Lloyd algorithm. Given a linear differential operator of order 2S, acting on functions psi(x_1,x_2,...,x_D) with D arguments, the computational cost required to estimate a low order eigenvalue to accuracy Theta(1/N^2) is Theta((2(S+1)(1+1/nu)+D)log N) qubits and O(N^{2(S+1)(1+1/nu)} (D log N)^c) gate operations, where N is the number of points to which each argument is discretized, nu and c are implementation dependent constants of O(1). Optimal classical methods require Theta(N^D) bits and Omega(N^D) gate operations to perform the same eigenvalue estimation. The Abrams-Lloyd algorithm thereby leads to exponential reduction in memory and polynomial reduction in gate operations, provided the domain has sufficiently large dimension D > 2(S+1)(1+1/nu). In the case of Schrodinger's equation, ground state energy estimation of two or more particles can in principle be performed with fewer quantum mechanical gates than classical gates.

quant-ph↗
arXiv2000

Quantum Clock Synchronization Based on Shared Prior Entanglement

We demonstrate that two spatially separated parties (Alice and Bob) can utilize shared prior quantum entanglement, and classical communications, to establish a synchronized pair of atomic clocks. In contrast to classical synchronization schemes, the accuracy of our protocol is independent of Alice or Bob's knowledge of their relative locations or of the properties of the intervening medium.

quant-ph↗
arXiv2000

Quantum Interferometric Optical Lithography: Exploiting Entanglement to Beat The Diffraction Limit

Classical, interferometric, optical lithography is diffraction limited to writing features of a size lambda/2 or greater, where lambda is the optical wavelength. Using nonclassical photon number states, entangled N at a time, we show that it is possible to write features of minimum size lambda/(2N) in an N-photon absorbing substrate. This result surpasses the usual classical diffraction limit by a factor of N. Since the number of features that can be etched on a two-dimensional surface scales inversely as the square of the feature size, this allows one to write a factor of N^2 more elements on a semiconductor chip. A factor of N = 2 can be achieved easily with entangled photon pairs generated from optical parametric downconversion. It is shown how to write arbitrary 2D patterns by using this method.

quant-ph↗
arXiv1999

Fast quantum algorithms for numerical integrals and stochastic processes

We discuss quantum algorithms that calculate numerical integrals and descriptive statistics of stochastic processes. With either of two distinct approaches, one obtains an exponential speed increase in comparison to the fastest known classical deterministic algorithms and a quadratic speed increase in comparison to classical Monte Carlo (probabilistic) methods. We derive a simpler and slightly faster version of Grover's mean algorithm, demonstrate how to apply quantum counting to the problem, develop some variations of these algorithms, and show how both (apparently quite different) approaches can be understood from the same unified framework. Finally, we discuss how the exponential speed increase appears to (but does not) violate results obtained via the method of polynomials, from which it is known that a bounded-error quantum algorithm for computing a total function can be only polynomially more efficient than the fastest deterministic classical algorithm.

quant-ph↗
arXiv1998

A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors

We describe a new polynomial time quantum algorithm that uses the quantum fast fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases (commonly found in ab initio physics and chemistry problems) for which all known classical algorithms require exponential time. Applications of the algorithm to specific problems are considered, and we find that classically intractable and interesting problems from atomic physics may be solved with between 50 and 100 quantum bits.

quant-ph↗
arXiv1998

Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems

If quantum states exhibit small nonlinearities during time evolution, then quantum computers can be used to solve NP-complete problems in polynomial time. We provide algorithms that solve NP-complete and #P oracle problems by exploiting nonlinear quantum logic gates. It is argued that virtually any deterministic nonlinear quantum theory will include such gates, and the method is explicitly demonstrated using the Weinberg model of nonlinear quantum mechanics.

quant-ph↗
arXiv1997

Simulation of Many-Body Fermi Systems on a Universal Quantum Computer

We provide fast algorithms for simulating many body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In order to accommodate fermions using a first quantized Hamiltonian, an efficient quantum algorithm for anti-symmetrization is given. Finally, a simulation of the Hubbard model is discussed in detail.

quant-ph↗