Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.24160

Trajectree - A quantum trajectory-based quantum circuit simulator

Ansh Singal, Allen Zang, Jordan Thomas, Alexander Kolar, Anirudh Ramesh, Joaquin Chung, Rajkumar Kettimuthu, Prem Kumar

quant-phSubmitted Oct 16, 2026• Announced Oct 20, 2026• 0 citations
arXivHTMLPDF

Abstract

We introduce Trajectree, a quantum trajectory-based quantum circuit simulator that uses a novel, state-saving partial execution of the quantum circuits to simulate broad and deep noisy quantum circuits efficiently. Trajectree can efficiently generate a large number of Monte Carlo samples by saving partially executed trajectories. We conduct extensive performance analysis of the Trajectree approach, proving the utility of the trajectory saving scheme for simulations of open quantum systems. Using this architecture, we show that Trajectree can simulate standard benchmark noisy circuits over five times faster than Google's QSim, a part of the Cirq package. We also analyze Trajectree's performance for simulating quantum optical systems relevant to communication and computing applications. We demonstrate applications of the optical backend to simulate three optical experiments: CHSH Bell test, entanglement swapping, and optical CNOT gate. This shows Trajectree's potential for simulating noisy qudit and optical systems efficiently.

AI Summary

Trajectree addresses the repeated computation required to generate Monte Carlo trajectories for noisy quantum circuits. It caches intermediate states and Kraus-branch probabilities in a tree, allowing subsequent independent samples to reuse previously computed circuit prefixes. A frequency-based cache policy limits stored trajectories, while a matrix-product-state/operator backend built on Quimb supports qubits and finite-dimensional optical modes. Performance is evaluated numerically using optical entanglement swapping and 25-qubit W-state, quantum-neural-network, and variational-eigensolver circuits. For entanglement swapping, the reported average sample time falls from approximately 55 seconds for the first sample to 0.1 seconds over 1,000 samples; the estimated uncached total is 55,000 seconds versus approximately 100 seconds with caching. Saving about 30 nodes provides similar timing to retaining all approximately 226 explored nodes in that example. Against Google's QSim, the paper reports speedups up to approximately $5\times$ on benchmarks with amplitude damping of 0.1% after each gate on each involved qubit. The optical backend reproduces a CHSH maximum just above 2.30 near mean photon number 0.66, entanglement-swapping visibility of $77\%\pm2\%$ from 100,000 samples versus a theoretical 77.7%, and an optical CNOT coincidence pattern. The stated tradeoffs include cache memory versus recomputation and stronger caching benefits when probability concentrates on few trajectories. Optical simulations require photon-number truncation; increasing mean photon number raises tensor-network bond dimensions and reduces their performance advantage. The implementation evaluated is single-core CPU, with parallelization left for future work.

Little sign of AI-generated textUnclear noveltyMissing comparisonOverclaimsPossible error

Error found: The abstract reports a QSim speedup of 'over five times' while the introduction reports 'up to 5×', a minor inconsistency that the supplied text cannot resolve. The broad performance claim is supported by QSim comparisons only for three 25-qubit circuit families with 0.1% amplitude damping, leaving its applicability beyond favorable trajectory distributions unestablished. The approximately 550-fold optical speedup uses an extrapolated uncached baseline from the first sample rather than a measured uncached simulation. The main-text thermal-loss Kraus operators incorrectly incorporate the thermal probability f(n) instead of its square root, disagreeing with the channel weighting in the appendix. The appendix's beamsplitter expansion omits bosonic factorial normalization factors, giving incorrect multiphoton amplitudes and undermining the printed optical model.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
15 pages, 22 figures

Related papers

Simulations of Quantum Circuits with Approximate Noise using qsim and Cirq

Sergei V. Isakov, Dvir Kafri, Orion Martin +15 more

We introduce multinode quantum trajectory simulations with qsim, an open source high performance simulator of quantum circuits. qsim can be used as a backend of Cirq, a Python software library for writing quantum circuits. We present a novel delayed inner product algorithm for quantum trajectories which can result in an order of magnitude speedup for low noise simulation. We also provide tools to use this framework in Google Cloud Platform, with high performance virtual machines in a single mode or multinode setting. Multinode configurations are well suited to simulate noisy quantum circuits with quantum trajectories. Finally, we introduce an approximate noise model for Google's experimental quantum computing platform and compare the results of noisy simulations with experiments for several quantum algorithms on Google's Quantum Computing Service.

arXiv:2111.02396•Nov 3, 2021•68 citations

Real-Time Sign-Problem-Suppressed Quantum Monte Carlo Algorithm for Noisy Quantum Circuit Simulations

Tong Shen, Daniel A. Lidar

We present a real-time quantum Monte Carlo algorithm that simulates the dynamics of open quantum systems by stochastically compressing and evolving the density matrix under both Markovian and non-Markovian master equations. Our algorithm uses population dynamics to continuously suppress the sign problem, preventing its accumulation throughout the evolution for a broad class of noisy-circuit Liouvillians of practical and experimental interest. We apply it to a variety of quantum circuits and demonstrate significant speedups and scaling improvements over state-of-the-art quantum trajectory methods and convergence to exact solutions even in non-Markovian regimes where trajectory methods fail. Our approach improves the efficiency of classical simulation of gate-based quantum computing, quantum annealing, and general open system dynamics.

arXiv:2502.18929•Physical Review Letters•Apr 30, 2026•3 citations

Speed-oriented quantum circuit backend

Sören Wilkening

We present a new software package for efficient quantum circuit generation, designed to achieve optimal runtime performance. Despite being in an early stage of development, our implementation demonstrates significant advantages over existing tools. Using the quantum Fourier transform (QFT) as a benchmark, we show that our backend can generate circuits for systems with up to 2000 qubits faster than widely used frameworks such as Qiskit and Q#. This improvement is particularly relevant for applications where classical preprocessing time, including circuit generation, must be minimized to not diminish any potential quantum advantage - for example, in combinatorial optimization tasks. Additionally, our software provides high-level primitives for bit- and integer-level manipulations, offering a simplified interface for integration with high-level quantum programming languages.

quant-pharXiv:2604.21656•Apr 24, 2026•0 citations

Approximation Algorithm for Noisy Quantum Circuit Simulation

Mingyu Huang, Ji Guan, Wang Sheng Fang +1 more

Simulating noisy quantum circuits is vital in de-signing and verifying quantum algorithms in the current NISQ (Noisy Intermediate-Scale Quantum) era, where quantum noise is unavoidable. However, it is much more inefficient than the classical counterpart because of the quantum state explosion problem (the dimension of state space is exponential in the number of qubits) and the complex (non-unitary) representation of noises. Consequently, only noisy circuits with up to about 50 qubits can be simulated approximately well. To improve the scalability of the circuits that can be simulated, this paper introduces a novel approximation algorithm for simulating noisy quantum circuits when the noisy effectiveness is insignificant. The algorithm is based on a new tensor network diagram for the noisy simulation and uses the singular value decomposition to approximate the tensors of quantum noises in the diagram. The contraction of the tensor network diagram is implemented on Google's TensorNetwork. The effectiveness and utility of the algorithm are demonstrated by experimenting on a series of practical quantum circuits with realistic superconducting noise models. As a result, our algorithm can approximately simulate quantum circuits with up to 225 qubits and 20 noises (within about 1.8 hours). In particular, our method offers a speedup over the commonly-used approximation (sampling) algorithm - quantum trajectories method [1]. Furthermore, our approach can significantly reduce the number of samples in the quantum trajectories method when the noise rate is small enough,

arXiv:2211.17028•Design, Automation, and Test in Europe•Mar 25, 2024•1 citation

QiliSim: A C++ Quantum Simulator for Digital/Analog Workflows

Luke Mortimer, D. Babal, Vyron Vasileiadis +1 more

This work presents QiliSim, the native C++ simulation backend of QiliSDK, an open-source Python framework for digital and analog quantum computing. QiliSim supports quantum circuits, Hamiltonian time evolution, and analog-digital quantum reservoirs through a common interface, allowing users to test quantum algorithms before executing them on quantum hardware. The simulator provides statevector and density-matrix methods for digital workloads, alongside fixed-step and adaptive Runge–Kutta integrators, Krylov-subspace methods, and direct matrix exponentiation for analog evolution. Monte Carlo trajectories, mid-circuit measurements, and Kraus and Lindbladian noise models support the simulation of noisy quantum systems. Numerical methods and execution settings are selected through structured configuration objects, allowing the same quantum program to run with different simulation strategies without modifying its definition. The poster includes a circuit simulation example and performance comparisons for digital circuit sampling and quantum annealing. The reported benchmarks show competitive CPU performance against Qiskit Aer and Cirq for small to medium circuits, and faster execution than QuTiP and CUDA-Q dynamics for the tested annealing task at a target fidelity of 99%.

•Sep 14, 2026•0 citations

TUSQ: Tracking, Uncomputation, and Sampling for Noisy Quantum Simulation

Siddharth Dangwal, Tina Oberoi, Ajay Sailopal +2 more

Quantum computers have improved in size and quality in recent years, enabling the execution of complex circuits. However, for most researchers, access to compute time is limited. This necessitates the development of simulators that mimic noisy quantum hardware accurately and scalably. The ideal way to simulate noisy systems is via Density Matrix Simulation (DMS). However, its high memory footprint limits its scalability. Consequently, noisy simulations are performed in two steps: (a) sampling multiple circuits with fixed noisy gates from the stochastic noise channels, (b) performing the State Vector Simulations (SVS) of these circuits and averaging their output to obtain the effective noisy simulation result. This often leads to a substantial increase in compute overhead, slowing down the simulation. Existing methods solve this problem by caching critical intermediate results in memory and reusing them. However, when a simulation task is both compute and memory-intensive, we need to eliminate computational overheads without incurring extra memory overheads. To enable fast simulation in the compute and memory bound regime, we propose TUSQ - Tracking, Uncomputation, and Sampling for Noisy Quantum Simulation. TUSQ is composed of two modules: the Error Characterization Module (ECM), and Depth First Tree Traversal (DFTT). The ECM characterizes errors so that the simulator can eliminate redundant circuit instances (via ER Tallying and ER Commutation), followed by importance sampling (in the Pruning stage), significantly reducing the number of circuits to be simulated relative to the baseline strategy of simulating all circuits. This is followed by DFTT, which computes the statevectors for these sampled circuits efficiently by taking advantage of circuit similarity, representing similar circuits in a tree and using computation and uncomputation to traverse the tree efficiently. TUSQ is evaluated for a total of 198 benchmarks, executed for 1 million shots and reports an average speedup of$59.06 \times$and$13.38 \times$over Qiskit and CUDA-Q, with a maximum speedup of$7878.03 \times$and$439.38 \times$respectively. We also compare TUSQ against TQSim in the time and memory critical regime. We observe an average and maximum speedup of$39.32 \times$and 3134.31×, respectively.

Proceedings - International Symposium on Computer Architecture/Proceedings•Jun 1, 2026•0 citations
We introduce Trajectree, a quantum trajectory-based quantum circuit simulator that uses a novel, state-saving partial execution of the quantum circuits to simulate broad and deep noisy quantum circuits efficiently. Trajectree can efficiently generate a large number of Monte Carlo samples by saving partially executed trajectories. We conduct extensive performance analysis of the Trajectree approach, proving the utility of the trajectory saving scheme for simulations of open quantum systems. Using this architecture, we show that Trajectree can simulate standard benchmark noisy circuits over five times faster than Google's QSim, a part of the Cirq package. We also analyze Trajectree's performance for simulating quantum optical systems relevant to communication and computing applications. We demonstrate applications of the optical backend to simulate three optical experiments: CHSH Bell test, entanglement swapping, and optical CNOT gate. This shows Trajectree's potential for simulating noisy qudit and optical systems efficiently.
Trajectree addresses the repeated computation required to generate Monte Carlo trajectories for noisy quantum circuits. It caches intermediate states and Kraus-branch probabilities in a tree, allowing subsequent independent samples to reuse previously computed circuit prefixes. A frequency-based cache policy limits stored trajectories, while a matrix-product-state/operator backend built on Quimb supports qubits and finite-dimensional optical modes.
Performance is evaluated numerically using optical entanglement swapping and 25-qubit W-state, quantum-neural-network, and variational-eigensolver circuits. For entanglement swapping, the reported average sample time falls from approximately 55 seconds for the first sample to 0.1 seconds over 1,000 samples; the estimated uncached total is 55,000 seconds versus approximately 100 seconds with caching. Saving about 30 nodes provides similar timing to retaining all approximately 226 explored nodes in that example. Against Google's QSim, the paper reports speedups up to approximately 5×5\times5× on benchmarks with amplitude damping of 0.1% after each gate on each involved qubit.
The optical backend reproduces a CHSH maximum just above 2.30 near mean photon number 0.66, entanglement-swapping visibility of 77%±2%77\%\pm2\%77%±2% from 100,000 samples versus a theoretical 77.7%, and an optical CNOT coincidence pattern.
The stated tradeoffs include cache memory versus recomputation and stronger caching benefits when probability concentrates on few trajectories. Optical simulations require photon-number truncation; increasing mean photon number raises tensor-network bond dimensions and reduces their performance advantage. The implementation evaluated is single-core CPU, with parallelization left for future work.
We introduce multinode quantum trajectory simulations with qsim, an open source high performance simulator of quantum circuits. qsim can be used as a backend of Cirq, a Python software library for writing quantum circuits. We present a novel delayed inner product algorithm for quantum trajectories which can result in an order of magnitude speedup for low noise simulation. We also provide tools to use this framework in Google Cloud Platform, with high performance virtual machines in a single mode or multinode setting. Multinode configurations are well suited to simulate noisy quantum circuits with quantum trajectories. Finally, we introduce an approximate noise model for Google's experimental quantum computing platform and compare the results of noisy simulations with experiments for several quantum algorithms on Google's Quantum Computing Service.
We present a real-time quantum Monte Carlo algorithm that simulates the dynamics of open quantum systems by stochastically compressing and evolving the density matrix under both Markovian and non-Markovian master equations. Our algorithm uses population dynamics to continuously suppress the sign problem, preventing its accumulation throughout the evolution for a broad class of noisy-circuit Liouvillians of practical and experimental interest. We apply it to a variety of quantum circuits and demonstrate significant speedups and scaling improvements over state-of-the-art quantum trajectory methods and convergence to exact solutions even in non-Markovian regimes where trajectory methods fail. Our approach improves the efficiency of classical simulation of gate-based quantum computing, quantum annealing, and general open system dynamics.
We present a new software package for efficient quantum circuit generation, designed to achieve optimal runtime performance. Despite being in an early stage of development, our implementation demonstrates significant advantages over existing tools. Using the quantum Fourier transform (QFT) as a benchmark, we show that our backend can generate circuits for systems with up to 2000 qubits faster than widely used frameworks such as Qiskit and Q#. This improvement is particularly relevant for applications where classical preprocessing time, including circuit generation, must be minimized to not diminish any potential quantum advantage - for example, in combinatorial optimization tasks. Additionally, our software provides high-level primitives for bit- and integer-level manipulations, offering a simplified interface for integration with high-level quantum programming languages.
Simulating noisy quantum circuits is vital in de-signing and verifying quantum algorithms in the current NISQ (Noisy Intermediate-Scale Quantum) era, where quantum noise is unavoidable. However, it is much more inefficient than the classical counterpart because of the quantum state explosion problem (the dimension of state space is exponential in the number of qubits) and the complex (non-unitary) representation of noises. Consequently, only noisy circuits with up to about 50 qubits can be simulated approximately well. To improve the scalability of the circuits that can be simulated, this paper introduces a novel approximation algorithm for simulating noisy quantum circuits when the noisy effectiveness is insignificant. The algorithm is based on a new tensor network diagram for the noisy simulation and uses the singular value decomposition to approximate the tensors of quantum noises in the diagram. The contraction of the tensor network diagram is implemented on Google's TensorNetwork. The effectiveness and utility of the algorithm are demonstrated by experimenting on a series of practical quantum circuits with realistic superconducting noise models. As a result, our algorithm can approximately simulate quantum circuits with up to 225 qubits and 20 noises (within about 1.8 hours). In particular, our method offers a speedup over the commonly-used approximation (sampling) algorithm - quantum trajectories method [1]. Furthermore, our approach can significantly reduce the number of samples in the quantum trajectories method when the noise rate is small enough,
This work presents QiliSim, the native C++ simulation backend of QiliSDK, an open-source Python framework for digital and analog quantum computing. QiliSim supports quantum circuits, Hamiltonian time evolution, and analog-digital quantum reservoirs through a common interface, allowing users to test quantum algorithms before executing them on quantum hardware. The simulator provides statevector and density-matrix methods for digital workloads, alongside fixed-step and adaptive Runge–Kutta integrators, Krylov-subspace methods, and direct matrix exponentiation for analog evolution. Monte Carlo trajectories, mid-circuit measurements, and Kraus and Lindbladian noise models support the simulation of noisy quantum systems. Numerical methods and execution settings are selected through structured configuration objects, allowing the same quantum program to run with different simulation strategies without modifying its definition. The poster includes a circuit simulation example and performance comparisons for digital circuit sampling and quantum annealing. The reported benchmarks show competitive CPU performance against Qiskit Aer and Cirq for small to medium circuits, and faster execution than QuTiP and CUDA-Q dynamics for the tested annealing task at a target fidelity of 99%.
Quantum computers have improved in size and quality in recent years, enabling the execution of complex circuits. However, for most researchers, access to compute time is limited. This necessitates the development of simulators that mimic noisy quantum hardware accurately and scalably. The ideal way to simulate noisy systems is via Density Matrix Simulation (DMS). However, its high memory footprint limits its scalability. Consequently, noisy simulations are performed in two steps: (a) sampling multiple circuits with fixed noisy gates from the stochastic noise channels, (b) performing the State Vector Simulations (SVS) of these circuits and averaging their output to obtain the effective noisy simulation result. This often leads to a substantial increase in compute overhead, slowing down the simulation. Existing methods solve this problem by caching critical intermediate results in memory and reusing them. However, when a simulation task is both compute and memory-intensive, we need to eliminate computational overheads without incurring extra memory overheads. To enable fast simulation in the compute and memory bound regime, we propose TUSQ - Tracking, Uncomputation, and Sampling for Noisy Quantum Simulation. TUSQ is composed of two modules: the Error Characterization Module (ECM), and Depth First Tree Traversal (DFTT). The ECM characterizes errors so that the simulator can eliminate redundant circuit instances (via ER Tallying and ER Commutation), followed by importance sampling (in the Pruning stage), significantly reducing the number of circuits to be simulated relative to the baseline strategy of simulating all circuits. This is followed by DFTT, which computes the statevectors for these sampled circuits efficiently by taking advantage of circuit similarity, representing similar circuits in a tree and using computation and uncomputation to traverse the tree efficiently. TUSQ is evaluated for a total of 198 benchmarks, executed for 1 million shots and reports an average speedup of59.06×59.06 \times59.06×and13.38×13.38 \times13.38×over Qiskit and CUDA-Q, with a maximum speedup of7878.03×7878.03 \times7878.03×and439.38×439.38 \times439.38×respectively. We also compare TUSQ against TQSim in the time and memory critical regime. We observe an average and maximum speedup of39.32×39.32 \times39.32×and 3134.31×, respectively.