Article

# Quantum algorithm and circuit design solving the Poisson equation

(Impact Factor: 3.56). 01/2013; 15:013021. DOI: 10.1088/1367-2630/15/1/013021
Source: arXiv

ABSTRACT

The Poisson equation occurs in many areas of science and engineering. Here we
focus on its numerical solution for an equation in d dimensions. In particular
we present a quantum algorithm and a scalable quantum circuit design which
approximates the solution of the Poisson equation on a grid with error
\varepsilon. We assume we are given a supersposition of function evaluations of
the right hand side of the Poisson equation. The algorithm produces a quantum
state encoding the solution. The number of quantum operations and the number of
qubits used by the circuit is almost linear in d and polylog in
\varepsilon^{-1}. We present quantum circuit modules together with performance
guarantees which can be also used for other problems.

### Full-text

Available from: Sabre Kais,
• Source
• "Moreover, since we know the eigenvalues and eigenvectors of L 0 , in certain cases one might be able to simulate its evolution explicitly without relying on an oracle. For instance when L 0 = −∆, a quantum algorithm and circuit implementing the evolution of the discretized Laplacian, is shown in [8]. That paper deals with the solution of the Poisson equation with Dirichlet boundary conditions. "
##### Article: Approximating Ground and Excited State Energies on a Quantum Computer
[Hide abstract]
ABSTRACT: Approximating ground and a fixed number of excited state energies, or equivalently low-order Hamiltonian eigenvalues, is an important but computationally hard problem. Typically, the cost of classical deterministic algorithms grows exponentially with the number of degrees of freedom. Under general conditions, and using a perturbation approach, we provide a quantum algorithm that produces estimates of a constant number $$j$$ of different low-order eigenvalues. The algorithm relies on a set of trial eigenvectors, whose construction depends on the particular Hamiltonian properties. We illustrate our results by considering a special case of the time-independent Schrödinger equation with $$d$$ degrees of freedom. Our algorithm computes estimates of a constant number $$j$$ of different low-order eigenvalues with error $$O(\varepsilon )$$ and success probability at least $$\frac{3}{4}$$ , with cost polynomial in $$\frac{1}{\varepsilon }$$ and $$d$$ . This extends our earlier results on algorithms for estimating the ground state energy. The technique we present is sufficiently general to apply to problems beyond the application studied in this paper.
Quantum Information Processing 04/2015; 14(4):1151-1178. DOI:10.1007/s11128-015-0927-y · 1.92 Impact Factor
• Source
##### Article: Rites of passage: Experiences of transition for forced Hazara migrants and refugees in Australia
[Hide abstract]
ABSTRACT: This article is about resettled Afghan Hazaras in Australia, many of whom are currently undergoing a complex process of transition (from transience into a more stable position) for the first time in their lives. Despite their permanent residency status, we show how resettlement can be a challenging transitional experience. For these new migrants, we argue that developing a sense of belonging during the transition period is a critical rite of passage in the context of their political and cultural identity. A study of forced migrants such as these, moving out of one transient experience into another transitional period (albeit one that holds greater promise and permanence) poses a unique intellectual challenge. New understandings about the ongoing, unpredictable consequences of ‘transience’ for refugee communities is crucial as we discover what might be necessary, as social support structures, to facilitate the process of transition into a distinctly new environment. The article is based on a doctoral ethnographic study of 30 resettled Afghan Hazara living in the region of Dandenong in Melbourne, Australia. Here, we include four of these participants’ reflections of transition during different phases of their resettlement. These reflections were particularly revealing of the ways in which some migrants deal with change and acquire a sense of belonging to the community. Taking a historical view, and drawing on Bourdieu’s notion of symbolic social capital to highlight themes in individual experiences of belonging, we show how some new migrants adjust and learn to ‘embody’ their place in the new country. Symbolic social capital illuminates how people access and use resources such as social networks as tools of empowerment, reflecting how Hazara post-arrival experiences are tied to complex power relations in their everyday social interactions and in their life trajectories as people in transition. We learned that such tools can facilitate the formation of Hazara migrant identities and are closely tied to their civic community participation, English language development, and orientation in, as well as comprehension of local cultural knowledge and place. This kind of theorization allows refugee, post-refugee and recent migrant narratives to be viewed not merely as static expressions of loss, trauma or damage, but rather as individual experiences of survival, adaptation and upward mobility.
Physical Review A 02/2013; 89(2). DOI:10.1103/PhysRevA.89.022313 · 2.81 Impact Factor
• Source
##### Article: Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits
[Hide abstract]
ABSTRACT: We develop a method for approximate synthesis of single--qubit rotations of the form $e^{-i f(\phi_1,\ldots,\phi_k)X}$ that is based on the Repeat-Until-Success (RUS) framework for quantum circuit synthesis. We demonstrate how smooth computable functions $f$ can be synthesized from two basic primitives. This synthesis approach constitutes a manifestly quantum form of arithmetic that differs greatly from the approaches commonly used in quantum algorithms. The key advantage of our approach is that it requires far fewer qubits than existing approaches: as a case in point, we show that using as few as $3$ ancilla qubits, one can obtain RUS circuits for approximate multiplication and reciprocals. We also analyze the costs of performing multiplication and inversion on a quantum computer using conventional approaches and find that they can require too many qubits to execute on a small quantum computer, unlike our approach.
Show more