ترغب بنشر مسار تعليمي؟ اضغط هنا

Efficient Quantum Algorithms for Simulating Lindblad Evolution

69   0   0.0 ( 0 )
 نشر من قبل Chunhao Wang
 تاريخ النشر 2016
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

We consider the natural generalization of the Schr{o}dinger equation to Markovian open system dynamics: the so-called the Lindblad equation. We give a quantum algorithm for simulating the evolution of an $n$-qubit system for time $t$ within precision $epsilon$. If the Lindbladian consists of $mathrm{poly}(n)$ operators that can each be expressed as a linear combination of $mathrm{poly}(n)$ tensor products of Pauli operators then the gate cost of our algorithm is $O(t, mathrm{polylog}(t/epsilon)mathrm{poly}(n))$. We also obtain similar bounds for the cases where the Lindbladian consists of local operators, and where the Lindbladian consists of sparse operators. This is remarkable in light of evidence that we provide indicating that the above efficiency is impossible to attain by first expressing Lindblad evolution as Schr{o}dinger evolution on a larger system and tracing out the ancillary system: the cost of such a textit{reduction} incurs an efficiency overhead of $O(t^2/epsilon)$ even before the Hamiltonian evolution simulation begins. Instead, the approach of our algorithm is to use a novel variation of the linear combinations of unitaries construction that pertains to channels.



قيم البحث

اقرأ أيضاً

Due to complexity of the systems and processes it addresses, the development of computational quantum physics is influenced by the progress in computing technology. Here we overview the evolution, from the late 1980s to the current year 2020, of the algorithms used to simulate dynamics of quantum systems. We put the emphasis on implementation aspects and computational resource scaling with the model size and propagation time. Our mini-review is based on a literature survey and our experience in implementing different types of algorithms.
We present a suite of holographic quantum algorithms for efficient ground-state preparation and dynamical evolution of correlated spin-systems, which require far-fewer qubits than the number of spins being simulated. The algorithms exploit the equiva lence between matrix-product states (MPS) and quantum channels, along with partial measurement and qubit re-use, in order to simulate a $D$-dimensional spin system using only a ($D$-1)-dimensional subset of qubits along with an ancillary qubit register whose size scales logarithmically in the amount of entanglement present in the simulated state. Ground states can either be directly prepared from a known MPS representation, or obtained via a holographic variational quantum eigensolver (holoVQE). Dynamics of MPS under local Hamiltonians for time $t$ can also be simulated with an additional (multiplicative) ${rm poly}(t)$ overhead in qubit resources. These techniques open the door to efficient quantum simulation of MPS with exponentially large bond-dimension, including ground-states of 2D and 3D systems, or thermalizing dynamics with rapid entanglement growth. As a demonstration of the potential resource savings, we implement a holoVQE simulation of the antiferromagnetic Heisenberg chain on a trapped-ion quantum computer, achieving within $10(3)%$ of the exact ground-state energy of an infinite chain using only a pair of qubits.
94 - Barry C. Sanders 2013
A universal quantum simulator would enable efficient simulation of quantum dynamics by implementing quantum-simulation algorithms on a quantum computer. Specifically the quantum simulator would efficiently generate qubit-string states that closely ap proximate physical states obtained from a broad class of dynamical evolutions. I provide an overview of theoretical research into universal quantum simulators and the strategies for minimizing computational space and time costs. Applications to simulating many-body quantum simulation and solving linear equations are discussed.
We introduce a framework for the calculation of ground and excited state energies of bosonic systems suitable for near-term quantum devices and apply it to molecular vibrational anharmonic Hamiltonians. Our method supports generic reference modal bas es and Hamiltonian representations, including the ones that are routinely used in classical vibrational structure calculations. We test different parametrizations of the vibrational wave function, which can be encoded in quantum hardware, based either on heuristic circuits or on the bosonic Unitary Coupled Cluster Ansatz. In particular, we define a novel compact heuristic circuit and demonstrate that it provides the best compromise in terms of circuit depth, optimization costs, and accuracy. We evaluate the requirements, number of qubits and circuit depth, for the calculation of vibrational energies on quantum hardware and compare them with state-of-the-art classical vibrational structure algorithms for molecules with up to seven atoms.
The phenomenon of entanglement sudden death (ESD) in finite dimensional composite open systems is described here for both bi-partite as well as multipartite cases, where individual subsystems undergo Lindblad type heat bath evolution. ESD is found to be generic for non-zero temperature of the bath. At T=0, one-sided action of the heat bath on pure entangled states of two qubits does not show ESD.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا