Einar Gabbassov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Einar Gabbassov has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Achim Kempf
University of Waterloo
1 shared publication - Artur Scherer
QB Information Technologies (1QBit)
1 shared publication - Gili Rosenberg
QB Information Technologies (1QBit)
1 shared publication - Iñaki Comas
Instituto de Biomedicina de Valencia, IBV-CSIC, Valencia, Spain
1 shared publication - Leonid Chindelevitch
MRC Center for Global Infectious Disease Analysis, School of Public Health, Imperial College London
1 shared publication - Maxwell Wing Libbrecht
Simon Fraser University
1 shared publication
Latest Publications
- Open Access
- 23 June 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (2)
Stochastic Schrödinger equations for quantum reverse diffusion
The ensemble-averaged dynamics of open quantum systems are typically irreversible. We show that this irreversibility need not hold at the level of individually monitored quantum trajectories. Our main results are analytical stochastic Schrödinger equations for quantum reverse diffusion, along with corresponding stochastic master equations. These equations describe the exact and approximate stochastic reverse processes for continuously monitored Pauli channels, including time-dependent depolarizing noise. We show that the reverse processes generalize the forward dynamics by combining the noise effects of the forward processes with an additional stochastic drift that dynamically steers a quantum state back to its initial configuration. Consequently, the exact reverse stochastic Schrödinger equations admit closed-form solutions that can be implemented in real time without the need for variational techniques. Our findings establish an analytical framework for quantum state recovery, noise-resilient quantum gates, quantum generative modeling, quantum tomography via forward-reverse cycles, and potential paradigms for quantum error correction based on reverse diffusion.
- 23 June 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (2)
Open AccessStochastic Schrödinger equations for quantum reverse diffusion
The ensemble-averaged dynamics of open quantum systems are typically irreversible. We show that this irreversibility need not hold at the level of individually monitored quantum trajectories. Our main results are analytical stochastic Schrödinger equations for quantum reverse diffusion, along with corresponding stochastic master equations. These equations describe the exact and approximate stochastic reverse processes for continuously monitored Pauli channels, including time-dependent depolarizing noise. We show that the reverse processes generalize the forward dynamics by combining the noise effects of the forward processes with an additional stochastic drift that dynamically steers a quantum state back to its initial configuration. Consequently, the exact reverse stochastic Schrödinger equations admit closed-form solutions that can be implemented in real time without the need for variational techniques. Our findings establish an analytical framework for quantum state recovery, noise-resilient quantum gates, quantum generative modeling, quantum tomography via forward-reverse cycles, and potential paradigms for quantum error correction based on reverse diffusion.
- Open Access
- 7 October 2025
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 10 (4) , 045054
Adiabatic dynamics of entanglement
We show that, during adiabatic evolution, any changes in entanglement can be attributed to a succession of avoided energy level crossings at which eigenvalues swap their eigenvectors. These swaps mediate the generation and redistribution of entanglement in multipartite systems. The efficiency of this redistribution depends on the narrowness of the avoided level crossings and thus constrains the speed of adiabatic evolution. Moreover, we relate the amount of entanglement involved to the ruggedness of the energy landscape, which directly affects the hardness of a computational problem. This enables an analysis of computational complexity and quantum advantage from the point of view of entanglement requirements. Applied to adiabatic quantum computation, our findings directly relate the computation’s speed to its utilization of entanglement as a resource. The same principles extend to gate-based discretized adiabatic quantum algorithms, including those for Hamiltonian simulation and combinatorial optimization.
- 7 October 2025
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 10 (4) , 045054
Open AccessAdiabatic dynamics of entanglement
We show that, during adiabatic evolution, any changes in entanglement can be attributed to a succession of avoided energy level crossings at which eigenvalues swap their eigenvectors. These swaps mediate the generation and redistribution of entanglement in multipartite systems. The efficiency of this redistribution depends on the narrowness of the avoided level crossings and thus constrains the speed of adiabatic evolution. Moreover, we relate the amount of entanglement involved to the ruggedness of the energy landscape, which directly affects the hardness of a computational problem. This enables an analysis of computational complexity and quantum advantage from the point of view of entanglement requirements. Applied to adiabatic quantum computation, our findings directly relate the computation’s speed to its utilization of entanglement as a resource. The same principles extend to gate-based discretized adiabatic quantum algorithms, including those for Hamiltonian simulation and combinatorial optimization.
- Open Access
- 25 June 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (2)
Lagrangian duality in quantum optimization: Overcoming QUBO limitations for constrained problems
We propose an approach to solving constrained combinatorial optimization problems based on embedding the concept of Lagrangian duality into the framework of adiabatic quantum computation. Within the setting of circuit-model fault-tolerant quantum computation, we demonstrate that this approach achieves a quadratic improvement in circuit depth and maintains a constraint-independent circuit width in contrast with the prevalent approach of solving constrained problems via reformulations based on the quadratic unconstrained binary optimization (QUBO) framework. In this study, we include a detailed review of the limitations encountered when using QUBO for constrained optimization. We show that the proposed method overcomes these limitations by encoding the optimal solution at an energetically elevated level of a simpler problem Hamiltonian, which results in substantially more resource-efficient quantum circuits. We consolidate our strategy with a detailed analysis on how the concepts of Lagrangian duality such as duality gap and complementary slackness relate to the success probability of sampling the optimal solution. Our findings are illustrated by benchmarking the Lagrangian dual approach against the QUBO approach using the NP-complete binary knapsack problem.
- 25 June 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (2)
Open AccessLagrangian duality in quantum optimization: Overcoming QUBO limitations for constrained problems
We propose an approach to solving constrained combinatorial optimization problems based on embedding the concept of Lagrangian duality into the framework of adiabatic quantum computation. Within the setting of circuit-model fault-tolerant quantum computation, we demonstrate that this approach achieves a quadratic improvement in circuit depth and maintains a constraint-independent circuit width in contrast with the prevalent approach of solving constrained problems via reformulations based on the quadratic unconstrained binary optimization (QUBO) framework. In this study, we include a detailed review of the limitations encountered when using QUBO for constrained optimization. We show that the proposed method overcomes these limitations by encoding the optimal solution at an energetically elevated level of a simpler problem Hamiltonian, which results in substantially more resource-efficient quantum circuits. We consolidate our strategy with a detailed analysis on how the concepts of Lagrangian duality such as duality gap and complementary slackness relate to the success probability of sampling the optimal solution. Our findings are illustrated by benchmarking the Lagrangian dual approach against the QUBO approach using the NP-complete binary knapsack problem.
- Open Access
- 12 September 2022
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 17 (9) , e0274632
Transit facility allocation: Hybrid quantum-classical optimization
An essential consideration in urban transit facility planning is service efficiency and accessibility. Previous research has shown that reducing the number of facilities along a route may increase efficiency but decrease accessibility. Striking a balance between these two is a critical consideration in transit planning. Transit facility consolidation is a cost-effective way to improve the quality of service by strategically determining the desirable allocation of a limited number of facilities. This paper develops an optimization framework that integrates Geographical Information systems (GIS), decision-making analysis, and quantum technologies for addressing the problem of facility consolidation. Our proposed framework includes a novel mathematical model that captures non-linear interactions between facilities and surrounding demand nodes, inter-facility competition, ridership demand and spatial coverage. The developed model can harness the power of quantum effects such as superposition and quantum tunnelling and enables transportation planners to utilize the most recent hardware solutions such as quantum and digital annealers, coherent Ising Machines and gate-based universal quantum computers. This study presents a real-world application of the framework to the public transit facility redundancy problem in the British Columbia Vancouver metropolitan area. We demonstrate the effectiveness of our framework by reducing the number of facilities by 40% while maintaining the same service accessibility. Additionally, we showcase the ability of the proposed mathematical model to take advantage of quantum annealing and classical optimization techniques.
- 12 September 2022
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 17 (9) , e0274632
Open AccessTransit facility allocation: Hybrid quantum-classical optimization
An essential consideration in urban transit facility planning is service efficiency and accessibility. Previous research has shown that reducing the number of facilities along a route may increase efficiency but decrease accessibility. Striking a balance between these two is a critical consideration in transit planning. Transit facility consolidation is a cost-effective way to improve the quality of service by strategically determining the desirable allocation of a limited number of facilities. This paper develops an optimization framework that integrates Geographical Information systems (GIS), decision-making analysis, and quantum technologies for addressing the problem of facility consolidation. Our proposed framework includes a novel mathematical model that captures non-linear interactions between facilities and surrounding demand nodes, inter-facility competition, ridership demand and spatial coverage. The developed model can harness the power of quantum effects such as superposition and quantum tunnelling and enables transportation planners to utilize the most recent hardware solutions such as quantum and digital annealers, coherent Ising Machines and gate-based universal quantum computers. This study presents a real-world application of the framework to the public transit facility redundancy problem in the British Columbia Vancouver metropolitan area. We demonstrate the effectiveness of our framework by reducing the number of facilities by 40% while maintaining the same service accessibility. Additionally, we showcase the ability of the proposed mathematical model to take advantage of quantum annealing and classical optimization techniques.
- Open Access
- 24 June 2021
- Published by Microbiology Society in Microbial Genomics
- Vol. 7 (6) , 000607
SplitStrains, a tool to identify and separate mixed Mycobacterium tuberculosis infections from WGS data
The occurrence of multiple strains of a bacterial pathogen such as M. tuberculosis or C. difficile within a single human host, referred to as a mixed infection, has important implications for both healthcare and public health. However, methods for detecting it, and especially determining the proportion and identities of the underlying strains, from WGS (whole-genome sequencing) data, have been limited. In this paper we introduce SplitStrains, a novel method for addressing these challenges. Grounded in a rigorous statistical model, SplitStrains not only demonstrates superior performance in proportion estimation to other existing methods on both simulated as well as real M. tuberculosis data, but also successfully determines the identity of the underlying strains. We conclude that SplitStrains is a powerful addition to the existing toolkit of analytical methods for data coming from bacterial pathogens and holds the promise of enabling previously inaccessible conclusions to be drawn in the realm of public health microbiology.
- 24 June 2021
- Published by Microbiology Society in Microbial Genomics
- Vol. 7 (6) , 000607
Open AccessSplitStrains, a tool to identify and separate mixed Mycobacterium tuberculosis infections from WGS data
The occurrence of multiple strains of a bacterial pathogen such as M. tuberculosis or C. difficile within a single human host, referred to as a mixed infection, has important implications for both healthcare and public health. However, methods for detecting it, and especially determining the proportion and identities of the underlying strains, from WGS (whole-genome sequencing) data, have been limited. In this paper we introduce SplitStrains, a novel method for addressing these challenges. Grounded in a rigorous statistical model, SplitStrains not only demonstrates superior performance in proportion estimation to other existing methods on both simulated as well as real M. tuberculosis data, but also successfully determines the identity of the underlying strains. We conclude that SplitStrains is a powerful addition to the existing toolkit of analytical methods for data coming from bacterial pathogens and holds the promise of enabling previously inaccessible conclusions to be drawn in the realm of public health microbiology.