arXiv (All)
open access
A first introduction to Matrix Product State algorithms for the integration of Lindblad equation
In this introductory review, we present and compare four algorithms for the numerical integration of the Lindblad equation for one-dimensional quantum lattice systems. All four methods are based on Matrix Product State representations and can be viewed as extensions of the Time-Evolving Block Decima
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Near-optimal quantum simulation of lattice Lindbladian dynamics#1131045
- Multivariate quantum state preparation with optimized tensor networks#987066
- Quantum element-wise transforms#1143797
- Query-Optimal and Gate-Efficient Lindbladian Simulation#1012923
- Solving Multiple Discretization Portfolio Optimization Problem with Quantum-Classical Hybrid Algorithms#299215
Record · ID 1012999
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive