Related papers: Singular value decomposition quantum algorithm for…
We propose a Newton algorithm to characterize the Hamiltonian of a quantum system interacting with a given laser field. The algorithm is based on the assumption that the evolution operator of the system is perfectly known at a fixed time.…
Efficiently characterising quantum systems, verifying operations of quantum devices and validating underpinning physical models, are central challenges for the development of quantum technologies and for our continued understanding of…
We present a quantum algorithm for simulating the dynamics of a first-quantized Hamiltonian in real space based on the truncated Taylor series algorithm. We avoid the possibility of singularities by applying various cutoffs to the system…
We explore the implementation of hybridly protected quantum operations combining the merits of holonomy, dynamical decoupling approach and dephasing-free feature based on a simple and experimentally achievable spin model. The implementation…
Solving optimisation problems is a promising near-term application of quantum computers. Quantum variational algorithms leverage quantum superposition and entanglement to optimise over exponentially large solution spaces using an…
A quantum algorithm is developed to calculate decay rates and cross sections using quantum resources that scale polynomially in the system size assuming similar scaling for state preparation and time evolution. This is done by computing…
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are…
The paper introduces an efficient implementation of the Deutsch-Jozsa and Bernstein-Vazirani algorithm using the single-particle discrete-time quantum walk. We also provide a detailed optical framework with specific optical components to…
Characterizing the interactions and dynamics of quantum mechanical systems is an essential task in the development of quantum technologies. We propose an efficient protocol based on the estimation of the time derivatives of few qubit…
Variational quantum algorithms (VQAs) provide a promising approach to achieving quantum advantage for practical problems on near-term noisy intermediate-scale quantum (NISQ) devices. Thus far, most studies on VQAs have focused on…
The simple genetic algorithm is proposed for the simulation of quantum many body dynamics. It uses the selection of entangled quantum states and has the inbuilt absolute decoherence that comes from the limitation of classical memory. It…
To study discrete dynamical systems of different types --- deterministic, statistical and quantum --- we develop various approaches. We introduce the concept of a system of discrete relations on an abstract simplicial complex and develop…
Quantum simulation is a foundational application for quantum computers, projected to offer insights into complex quantum systems beyond the reach of classical computation. However, with the exception of Trotter-based methods, which suffer…
We develop a quantum scattering model to describe the exciton transport through the Fenna-Matthews-Olson(FMO) complex. It is found that the exciton transport involved the optimal quantum coherence is more efficient than that involved…
Simulating physical systems has been an important application of classical and quantum computers. In this article we present an efficient classical algorithm for simulating time-dependent quantum mechanical Hamiltonians over constant…
The generalized singular value decomposition (GSVD) is a valuable tool that has many applications in computational science. However, computing the GSVD for large-scale problems is challenging. Motivated by applications in hyper-differential…
Singular value decompositions of matrices are widely used in numerical linear algebra with many applications. In this paper, we extend the notion of singular value decompositions to finite complexes of real vector spaces. We provide two…
We present a quantum algorithm for the dynamical simulation of time-dependent Hamiltonians. Our method involves expanding the interaction-picture Hamiltonian as a sum of generalized permutations, which leads to an integral-free Dyson series…
In this paper, we introduce a major advancement in Quantum Singular Value Transformation (QSVT) through the development of Feedforward QSVT (FQSVT), a framework that significantly enhances the efficiency and robustness of quantum algorithm…
We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum…