In light of recent exciting progress in building up quantum computing facilities based on both optical and cold-atom techniques, the algorithms for quantum simulations of particle-physics systems are in rapid progress. In this paper, we propose an efficient algorithm for simulating the non-unitary time evolution of neutral-kaon oscillations $K^0 \leftrightarrow \overline{K}^0$, with or without CP conservation, on the quantum computers provided by the IBM company. The essential strategy is to realize the time-evolution operator with basic quantum gates and an extra qubit corresponding to some external environment. The final results are well consistent with theoretical expectations, and the algorithm can also be applied to open systems beyond elementary particles.
In light of recent exciting progress in building up quantum computing facilities based on both optical and cold-atom techniques, the algorithms for quantum simulations of particle-physics systems are in rapid progress. In this paper, we propose an efficient algorithm for simulating the non-unitary time evolution of neutral-kaon oscillations K0↔K0, with or without CP conservation, on the quantum computers provided by the IBM company. The essential strategy is to realize the time-evolution operator with basic quantum gates and an extra qubit corresponding to some external environment. The final results are well consistent with theoretical expectations, and the algorithm can also be applied to open systems beyond elementary particles.
Designing quantum algorithms for simulating quantum systems has seen enormous progress, yet few studies have been done to develop quantum algorithms for open quantum dynamics despite its importance in modeling the system-environment interaction found in most realistic physical models. In this work we propose and demonstrate a general quantum algorithm to evolve open quantum dynamics on quantum computing devices. The Kraus operators governing the time evolution can be converted into unitary matrices with minimal dilation guaranteed by the Sz.-Nagy theorem. This allows the evolution of the initial state through unitary quantum gates, while using significantly less resource than required by the conventional Stinespring dilation. We demonstrate the algorithm on an amplitude damping channel using the IBM Qiskit quantum simulator and the IBM Q 5 Tenerife quantum device. The proposed algorithm does not require particular models of dynamics or decomposition of the quantum channel, and thus can be easily generalized to other open quantum dynamical models.
This thesis introduces an algorithm for efficiently simulating the non-unitary dynamics of open quantum systems on quantum computers. Open quantum systems interact with their surrounding environment, resulting in non-unitary dynamics. This creates a fundamental challenge for quantum simulation, since quantum hardware is inherently restricted to unitary operations. Building on the Kraus operator sum representation, this work explores dilation techniques that embed non-unitary maps into larger unitary operations, suitable for implementation on quantum processors. In addition to reproducing recent results from the literature, an enhanced algorithm that reuses the quantum state from the previous time step is presented. This reuse strategy increases efficiency, permits repeated application of the same quantum circuit, and shifts the dominant computational workload toward the quantum processor. The method is implemented and tested on models of the Fenna–Matthews–Olson light-harvesting complex and compares the obtained results against existing approaches. Importantly, the algorithm is broadly applicable to a wide class of open quantum systems. The proposed scheme provides a practical pathway for studying transport, dynamics, and spectral properties of interacting quantum systems on a quantum simulator, while keeping the demands on classical resources modest. The thesis concludes with a discussion of implementation details, numerical results, and prospects for scaling the method to larger systems.
Practical quantum systems are open systems due to interactions with their environment. Understanding the evolution of open systems dynamics is important for quantum noise processes , designing quantum error correcting codes, and performing simulations of open quantum systems. Here we proposed an efficient quantum algorithm for simulating the evolution of an open quantum system on a duality quantum computer. In contrast to unitary evolution in a usual quantum computer, the evolution operator in a duality quantum computer is a linear combination of unitary operators. In this duality algorithm, the time evolution of open quantum system is realized by using Kraus operators which is naturally realized in duality quantum computing. Compared to the Lloyd's quantum algorithm [Science.273, 1073(1996)] , the dependence on the dimension of the open quantum system in our algorithm is decreased. Moreover, our algorithm uses a truncated Taylor series of the evolution operators, exponentially improving the performance on the precision compared with existing quantum simulation algorithms with unitary evolution operations.
The rapid advancement of quantum computing has created new opportunities for solving computationally intensive problems across diverse fields such as optimization, physical system simulation, and machine learning. However, practical implementation on Noisy Intermediate-Scale Quantum (NISQ) devices remains challenging due to hardware limitations including noise, decoherence, and restricted qubit connectivity. A fundamental constraint further complicating this effort is that all quantum operations must be unitary, while many real-world problems are naturally expressed in non-unitary forms. This discrepancy necessitates novel techniques for transforming non-unitary mathematical structures into unitary or Hamiltonian representations compatible with quantum hardware.This thesis proposes a unified framework for converting structured, sparse, or otherwise non-unitary classical matrices into unitary forms that can be executed efficiently on NISQ devices. The methodology introduces general transformation strategies such as linear combinations of unitaries, structured embeddings, and resource-aware circuit construction, enabling the deployment of quantum algorithms without incurring prohibitive overhead. Each technique is developed with an emphasis on preserving problem structure, minimizing circuit depth, and ensuring compatibility with IBM’s NISQ hardware. The proposed frameworks are validated through theoretical analysis and quantum simulations, with performance benchmarks based on gate count, circuit fidelity, convergence behavior, and scalability. This work demonstrates how non-unitary formulations arising in various computational contexts can be systematically adapted for quantum execution, advancing the practical utility of NISQ-era devices.
Classical non-perturbative simulations of open quantum systems' dynamics face several scalability problems, namely, exponential scaling of the computational effort as a function of either the time length of the simulation or the size of the open system. In this work, we propose the use of the Time Evolving Density operator with Orthogonal Polynomials Algorithm (TEDOPA) on a quantum computer, which we term as Quantum TEDOPA (Q-TEDOPA), to simulate non-perturbative dynamics of open quantum systems linearly coupled to a bosonic environment (continuous phonon bath). By performing a change of basis of the Hamiltonian, the TEDOPA yields a chain of harmonic oscillators with only local nearest-neighbour interactions, making this algorithm suitable for implementation on quantum devices with limited qubit connectivity such as superconducting quantum processors. We analyse in detail the implementation of the TEDOPA on a quantum device and show that exponential scalings of computational resources can potentially be avoided for time-evolution simulations of the systems considered in this work. We applied the proposed method to the simulation of the exciton transport between two light-harvesting molecules in the regime of moderate coupling strength to a non-Markovian harmonic oscillator environment on an IBMQ device. Applications of the Q-TEDOPA span problems which can not be solved by perturbation techniques belonging to different areas, such as the dynamics of quantum biological systems and strongly correlated condensed matter systems.
Because of inevitable coupling with the environment, nearly all practical quantum systems are open system, where the evolution is not necessarily unitary. In this paper, we propose a duality quantum algorithm for simulating Hamiltonian evolution of an open quantum system. In contrast to unitary evolution in a usual quantum computer, the evolution operator in a duality quantum computer is a linear combination of unitary operators. In this duality quantum algorithm, the time evolution of the open quantum system is realized by using Kraus operators which is naturally implemented in duality quantum computer. This duality quantum algorithm has two distinct advantages compared to existing quantum simulation algorithms with unitary evolution operations. Firstly, the query complexity of the algorithm is O(d(3)) in contrast to O(d(4)) in existing unitary simulation algorithm, where d is the dimension of the open quantum system. Secondly, By using a truncated Taylor series of the evolution operators, this duality quantum algorithm provides an exponential improvement in precision compared with previous unitary simulation algorithm.