Related papers: Variational Quantum Algorithm for Unitary Dilation
The impressive progress in quantum hardware in the last years has raised the interest of the quantum computing community in harvesting the computational power of such devices. However, in the absence of error correction, these devices can…
The development of quantum computers has been the stimulus that enables the realization of Quantum Machine Learning (QML), an area that integrates the calculational framework of quantum mechanics with the adaptive properties of classical…
Density matrices evolved according the von Neumann equation are commonly used to simulate the dynamics of driven quantum systems. However, computational methods using density matrices are often too slow to explore the large parameter spaces…
Quantum simulation has begun to penetrate the field of quantum chemistry in hopes of efficiently calculating ground state energies and approximating real-time evolution. With modern research highlighting nonadiabatic dynamics, tunably…
The quantum approximate optimisation algorithm was proposed as a heuristic method for solving combinatorial optimisation problems on near-term quantum computers and may be among the first algorithms to perform useful computations in the…
The dynamics of many-body quantum states in open systems is commonly numerically simulated by unraveling the density matrix into pure-state trajectories. In this work, we introduce a new unraveling strategy that can adaptively minimize the…
In the Bloch sphere picture, one finds the coefficients for expanding a single-qubit density operator in terms of the identity and Pauli matrices. A generalization to $n$ qubits via tensor products represents a density operator by a real…
Many claims of computational advantages have been made for quantum computing over classical, but they have not been demonstrated for practical problems. Here, we present algorithms for solving time-dependent PDEs, with particular reference…
We present a quantum algorithm for simulating dissipative diffusion dynamics generated by positive semidefinite operators of the form $A=L^\dagger L$, a structure that arises naturally in standard discretizations of elliptic operators. Our…
Hybrid quantum-classical algorithms are among the most promising systems to implement quantum computing under the Noisy-Intermediate Scale Quantum (NISQ) technology. In this paper, at first, we investigate a quantum dynamics algorithm for…
Although quantum computing holds promise for solving Combinatorial Optimization Problems (COPs), the limited qubit capacity of NISQ hardware makes large-scale instances intractable. Conventional methods attempt to bridge this gap through…
Overcoming the influence of noise and imperfections is a major challenge in quantum computing. Here, we present an approach based on applying a desired unitary computation in superposition between the system of interest and some auxiliary…
The standard paradigm for state preparation on quantum computers for the simulation of physical systems in the near term has been widely explored with different algorithmic methods. One such approach is the optimization of parameterized…
We apply the Krotov method for open and closed quantum systems with the objective of finding optimized controls to manipulate qubit/qutrit systems in the presence of the external environment. In the case of unitary optimization, the Krotov…
We propose a hybrid quantum-classical algorithm to compute approximate solutions of binary combinatorial problems. We employ a shallow-depth quantum circuit to implement a unitary and Hermitian operator that block-encodes the weighted…
Evaluating the entanglement spectrum is essential for characterizing exotic quantum phases such as quantum criticality and topological order. However, for large quantum many-body systems, this task is hindered by the exponential measurement…
Variational quantum algorithms have found success in the NISQ era owing to their hybrid quantum-classical approach which mitigate the problems of noise in quantum computers. In our study we introduce the dynamic ansatz in the Variational…
Current technologies in quantum-based communications bring a new integration of quantum data with classical data for hybrid processing. However, the frameworks of these technologies are restricted to a single classical or quantum task,…
The paper presents a variational quantum algorithm to solve initial-boundary value problems described by second-order partial differential equations. The approach uses hybrid classical/quantum hardware that is well suited for quantum…
Variational Quantum Algorithms (VQAs) are promising methods for solving combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) devices. However, benchmarking VQAs is difficult due to their stochastic behavior and the…