Related papers: Parallel Quantum Algorithm for Hamiltonian Simulat…
We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As in previous work [Babbush et al., New…
In holonomic quantum computation, quantum logic gates are realized by cyclic parallel transport of the computational space. The resulting quantum gate corresponds to the holonomy associated with the closed path traced by the computational…
Random walks are a fundamental primitive used in many machine learning algorithms with several applications in clustering and semi-supervised learning. Despite their relevance, the first efficient parallel algorithm to compute random walks…
Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. The existing algorithms generally approximate the time evolution operators, which may need a deep…
We have developed an application and implemented parallel algorithms in order to provide a computational framework suitable for massively parallel supercomputers to study the unitary dynamics of quantum systems. We use renowned parallel…
We study the efficiency of algorithms simulating a system evolving with Hamiltonian $H=\sum_{j=1}^m H_j$. We consider high order splitting methods that play a key role in quantum Hamiltonian simulation. We obtain upper bounds on the number…
Optimization of quantum programs or circuits is a fundamental problem in quantum computing and remains a major challenge. State-of-the-art quantum circuit optimizers rely on heuristics and typically require superlinear, and even…
Quantum circuit synthesis is the process in which an arbitrary unitary operation is decomposed into a sequence of gates from a universal set, typically one which a quantum computer can implement both efficiently and fault-tolerantly. As…
Parallel processing of information plays a critical role in accelerating computation. This includes quantum computers, where parallel processing of quantum information will play a critical role in practical quantum advantage. Here, we…
A quantum computing simulation provides the opportunity to explore the behaviors of quantum circuits, study the properties of quantum gates, and develop quantum computing algorithms. Simulating quantum circuits requires geometric time and…
A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems. Quantum algorithms for fermionic system simulation usually involve the Hamiltonian evolution and measurements. However, in…
Recently, several groups have investigated quantum analogues of random walk algorithms, both on a line and on a circle. It has been found that the quantum versions have markedly different features to the classical versions. Namely, the…
In this paper, we firstly briefly review the duality quantum computer. Distinctly, the generalized quantum gates, the basic evolution operators in a duality quantum computer are no longer unitary, and they can be expressed in terms of…
Quantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic…
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel…
Non-autonomous dynamical systems appear in a very wide range of interesting applications, both in classical and quantum dynamics, where in the latter case it corresponds to having a time-dependent Hamiltonian. However, the quantum…
Recent technological advancements show promise in leveraging quantum mechanical phenomena for computation. This brings substantial speed-ups to problems that are once considered to be intractable in the classical world. However, the…
Quantum computation holds the promise of solving computational problems which are believed to be classically intractable. However, in practice, quantum devices are still limited by their relatively short coherence times and imperfect…
While quantum simulators promise to explore quantum many-body physics beyond classical computation, their capabilities are limited by the available native interactions in the hardware. On many platforms, accessible Hamiltonians are largely…
Hamiltonian simulation is known to be one of the fundamental building blocks of a variety of quantum algorithms such as its most immediate application, that of simulating many-body systems to extract their physical properties. In this work,…