Kristel Michielsen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kristel Michielsen has a total of 168 co-authors. Here are the top co-authors by number of shared publications:
- Hans De Raedt
Forschungszentrum Jülich
107 shared publications - Fengping Jin
Forschungszentrum Jülich
24 shared publications - Dennis Willsch
Jülich Supercomputing Centre Institute for Advanced Simulation Forschungszentrum Jülich 52425 Jülich Germany
17 shared publications Fengping Jin
Institute for Advanced Simulation, Jülich Supercomputing Centre, Forschungszentrum Jülich, Jülich, D-52425, Germany
12 shared publicationsF. Jin
Institute for Advanced Simulation
11 shared publicationsHans De Raedt
Institute for Advanced Simulation, Jülich Supercomputing Centre, Forschungszentrum Jülich, Jülich, D-52425, Germany
11 shared publications
Latest Publications
- Open Access
- 26 August 2026
- Published by Springer Nature in Research Square
Resonant false vacuum decay in two dimensions on a 4000-qubit quantum annealer
From cosmology to quantum matter, metastable states often decay through the nucleation and growth of competing domains, with false vacuum decay providing the paradigmatic example of this process. Here we demonstrate a distinct regime in which domain growth outpaces nucleation by orders of magnitude and is controlled by local resonance conditions. Using a programmable quantum annealer with more than 4000 qubits, we realize a two-dimensional quantum Ising model whose metastable spin-polarized state encodes a false vacuum. At a specific value of the longitudinal field, single-spin flips at the boundary of a seeded bubble become resonant, enabling kinetically constrained expansion. Combining experiment with tensor-network simulations and stochastic circuit modeling, we observe nearly ballistic growth of true-vacuum domains with sub-ballistic interface broadening, consistent with Kardar--Parisi--Zhang universality. Our results establish a growth-dominated regime of false vacuum decay and show how large-scale quantum simulation can access nonequilibrium metastable dynamics relevant to quantum field theory, cosmology, and strongly correlated matter.
- 26 August 2026
- Published by Springer Nature in Research Square
Open AccessResonant false vacuum decay in two dimensions on a 4000-qubit quantum annealer
From cosmology to quantum matter, metastable states often decay through the nucleation and growth of competing domains, with false vacuum decay providing the paradigmatic example of this process. Here we demonstrate a distinct regime in which domain growth outpaces nucleation by orders of magnitude and is controlled by local resonance conditions. Using a programmable quantum annealer with more than 4000 qubits, we realize a two-dimensional quantum Ising model whose metastable spin-polarized state encodes a false vacuum. At a specific value of the longitudinal field, single-spin flips at the boundary of a seeded bubble become resonant, enabling kinetically constrained expansion. Combining experiment with tensor-network simulations and stochastic circuit modeling, we observe nearly ballistic growth of true-vacuum domains with sub-ballistic interface broadening, consistent with Kardar--Parisi--Zhang universality. Our results establish a growth-dominated regime of false vacuum decay and show how large-scale quantum simulation can access nonequilibrium metastable dynamics relevant to quantum field theory, cosmology, and strongly correlated matter.
- 5 February 2026
- Published by Springer Nature
- p. 56-64
Towards Large-Scale Satellite Acquisition Scheduling with Hybrid Quantum-Classical Optimization
- 5 February 2026
- Published by Springer Nature
- p. 56-64
Towards Large-Scale Satellite Acquisition Scheduling with Hybrid Quantum-Classical Optimization
- 5 February 2026
- Published by Springer Nature
- p. 105-116
Quantum-Enhanced Consensus Clustering Through Quantum Annealing and QAOA
- 5 February 2026
- Published by Springer Nature
- p. 105-116
Quantum-Enhanced Consensus Clustering Through Quantum Annealing and QAOA
- Open Access
- 24 November 2025
- Published by Frontiers Media SA in Frontiers in Computer Science
- Vol. 7
Correction: Benchmarking quantum annealing with maximum cardinality matching problems
- 24 November 2025
- Published by Frontiers Media SA in Frontiers in Computer Science
- Vol. 7
Open AccessCorrection: Benchmarking quantum annealing with maximum cardinality matching problems
- Open Access
- 12 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 40 (6) , 4958-4970
Quantum Annealing Based Power Grid Partitioning for Parallel Simulation
Graph partitioning has many applications in power systems, from decentralized state estimation to parallel simulation. Focusing on parallel simulation, optimal grid partitioning minimizes the idle time caused by different simulation times for the sub-networks and their components and reduces the overhead required to simulate the cuts. Partitioning a graph into two parts such that, for example, the cut is minimal and the sub-graphs have equal size is an NP-hard problem. In this paper, we show how optimal partitioning of a graph can be obtained using quantum annealing (QA). We show how to map the requirements for optimal splitting to a quadratic unconstrained binary optimization (QUBO) formulation and test the proposed formulation using a current D-Wave QPU. We show that the necessity to find an embedding of the QUBO on current D-Wave QPUs limits the problem size to under 200 buses and notably affects the time-to-solution. We finally discuss the implications of quantum hardware non-ideality on near term implementation in the simulation loop.
- 12 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 40 (6) , 4958-4970
Open AccessQuantum Annealing Based Power Grid Partitioning for Parallel Simulation
Graph partitioning has many applications in power systems, from decentralized state estimation to parallel simulation. Focusing on parallel simulation, optimal grid partitioning minimizes the idle time caused by different simulation times for the sub-networks and their components and reduces the overhead required to simulate the cuts. Partitioning a graph into two parts such that, for example, the cut is minimal and the sub-graphs have equal size is an NP-hard problem. In this paper, we show how optimal partitioning of a graph can be obtained using quantum annealing (QA). We show how to map the requirements for optimal splitting to a quadratic unconstrained binary optimization (QUBO) formulation and test the proposed formulation using a current D-Wave QPU. We show that the necessity to find an embedding of the QUBO on current D-Wave QPUs limits the problem size to under 200 buses and notably affects the time-to-solution. We finally discuss the implications of quantum hardware non-ideality on near term implementation in the simulation loop.
- Open Access
- 4 February 2025
- Published by Springer Nature in Nature Physics
- Vol. 21 (3) , 386-392
Stirring the false vacuum via interacting quantized bubbles on a 5,564-qubit quantum annealer
False vacuum decay—the transition from a metastable quantum state to a true vacuum state—plays an important role in quantum field theory and non-equilibrium phenomena such as phase transitions and dynamical metastability. The non-perturbative nature of false vacuum decay and the limited experimental access to this process make it challenging to study, leaving several open questions regarding how true vacuum bubbles form, move and interact. Here we observe quantized bubble formation in real time, a key feature of false vacuum decay dynamics, using a quantum annealer with 5,564 superconducting flux qubits. We develop an effective model that captures both initial bubble creation and subsequent interactions, and remains accurate under dissipation. The annealer reveals coherent scaling laws in the driven many-body dynamics for more than 1,000 intrinsic qubit time units. This work provides a method for investigating false vacuum dynamics of large quantum systems in quantum annealers.
- 4 February 2025
- Published by Springer Nature in Nature Physics
- Vol. 21 (3) , 386-392
Open AccessStirring the false vacuum via interacting quantized bubbles on a 5,564-qubit quantum annealer
False vacuum decay—the transition from a metastable quantum state to a true vacuum state—plays an important role in quantum field theory and non-equilibrium phenomena such as phase transitions and dynamical metastability. The non-perturbative nature of false vacuum decay and the limited experimental access to this process make it challenging to study, leaving several open questions regarding how true vacuum bubbles form, move and interact. Here we observe quantized bubble formation in real time, a key feature of false vacuum decay dynamics, using a quantum annealer with 5,564 superconducting flux qubits. We develop an effective model that captures both initial bubble creation and subsequent interactions, and remains accurate under dissipation. The annealer reveals coherent scaling laws in the driven many-body dynamics for more than 1,000 intrinsic qubit time units. This work provides a method for investigating false vacuum dynamics of large quantum systems in quantum annealers.
- Open Access
- 6 June 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (2) , 023251
Lindblad dynamics from spatio-temporal correlation functions in nonintegrable spin- chains with different boundary conditionsWe investigate the Lindblad equation in the context of boundary-driven magnetization transport in spin- chains. Our central question is whether the nonequilibrium steady state of the open system, including its buildup in time, can be described on the basis of the dynamics in the closed system. To this end, we rely on a previous study [Heitmann et al., Phys. Rev. B 108, L201119 (2023)], in which a description in terms of spatio-temporal correlation functions was suggested in the case of weak driving and small system-bath coupling. Because this work focused on integrable systems and periodic boundary conditions, we here extend the analysis in three directions: (1) We consider nonintegrable systems, (2) we take into account open boundary conditions and other bath-coupling geometries, and (3) we provide a comparison to time-evolving block decimation. While we find that nonintegrability plays a minor role, the choice of the specific boundary conditions can be crucial due to potentially nondecaying edge modes. Our large-scale numerical simulations suggest that a description based on closed-system correlation functions is a useful alternative to already existing state-of-the-art approaches.- 6 June 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (2) , 023251
Open AccessLindblad dynamics from spatio-temporal correlation functions in nonintegrable spin- chains with different boundary conditionsWe investigate the Lindblad equation in the context of boundary-driven magnetization transport in spin- chains. Our central question is whether the nonequilibrium steady state of the open system, including its buildup in time, can be described on the basis of the dynamics in the closed system. To this end, we rely on a previous study [Heitmann et al., Phys. Rev. B 108, L201119 (2023)], in which a description in terms of spatio-temporal correlation functions was suggested in the case of weak driving and small system-bath coupling. Because this work focused on integrable systems and periodic boundary conditions, we here extend the analysis in three directions: (1) We consider nonintegrable systems, (2) we take into account open boundary conditions and other bath-coupling geometries, and (3) we provide a comparison to time-evolving block decimation. While we find that nonintegrability plays a minor role, the choice of the specific boundary conditions can be crucial due to potentially nondecaying edge modes. Our large-scale numerical simulations suggest that a description based on closed-system correlation functions is a useful alternative to already existing state-of-the-art approaches. - Open Access
- 5 June 2024
- Published by Frontiers Media SA in Frontiers in Computer Science
- Vol. 6, 1286057
Benchmarking quantum annealing with maximum cardinality matching problems
We benchmark Quantum Annealing (QA) vs. Simulated Annealing (SA) with a focus on the impact of the embedding of problems onto the different topologies of the D-Wave quantum annealers. The series of problems we study are especially designed instances of the maximum cardinality matching problem that are easy to solve classically but difficult for SA and, as found experimentally, not easy for QA either. In addition to using several D-Wave processors, we simulate the QA process by numerically solving the time-dependent Schrödinger equation. We find that the embedded problems can be significantly more difficult than the unembedded problems, and some parameters, such as the chain strength, can be very impactful for finding the optimal solution. Thus, finding a good embedding and optimal parameter values can improve the results considerably. Interestingly, we find that although SA succeeds for the unembedded problems, the SA results obtained for the embedded version scale quite poorly in comparison with what we can achieve on the D-Wave quantum annealers.
- 5 June 2024
- Published by Frontiers Media SA in Frontiers in Computer Science
- Vol. 6, 1286057
Open AccessBenchmarking quantum annealing with maximum cardinality matching problems
We benchmark Quantum Annealing (QA) vs. Simulated Annealing (SA) with a focus on the impact of the embedding of problems onto the different topologies of the D-Wave quantum annealers. The series of problems we study are especially designed instances of the maximum cardinality matching problem that are easy to solve classically but difficult for SA and, as found experimentally, not easy for QA either. In addition to using several D-Wave processors, we simulate the QA process by numerically solving the time-dependent Schrödinger equation. We find that the embedded problems can be significantly more difficult than the unembedded problems, and some parameters, such as the chain strength, can be very impactful for finding the optimal solution. Thus, finding a good embedding and optimal parameter values can improve the results considerably. Interestingly, we find that although SA succeeds for the unembedded problems, the SA results obtained for the embedded version scale quite poorly in comparison with what we can achieve on the D-Wave quantum annealers.
- Open Access
- 4 April 2024
- Published by Springer Nature in Nature Physics
- Vol. 20 (5) , 878
Publisher Correction: Observation of Josephson harmonics in tunnel junctions
- 4 April 2024
- Published by Springer Nature in Nature Physics
- Vol. 20 (5) , 878
Open AccessPublisher Correction: Observation of Josephson harmonics in tunnel junctions
- Top Cited PapersOpen Access
- 1 April 2024
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 9 (2) , 025022
Unbalanced penalization: a new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
Solving combinatorial optimization problems of the kind that can be codified by quadratic unconstrained binary optimization (QUBO) is a promising application of quantum computation. Some problems of this class suitable for practical applications such as the traveling salesman problem (TSP), the bin packing problem (BPP), or the knapsack problem (KP) have inequality constraints that require a particular cost function encoding. The common approach is the use of slack variables to represent the inequality constraints in the cost function. However, the use of slack variables considerably increases the number of qubits and operations required to solve these problems using quantum devices. In this work, we present an alternative method that does not require extra slack variables and consists of using an unbalanced penalization function to represent the inequality constraints in the QUBO. This function is characterized by larger penalization when the inequality constraint is not achieved than when it is. We evaluate our approach on the TSP, BPP, and KP, successfully encoding the optimal solution of the original optimization problem near the ground state cost Hamiltonian. Additionally, we employ D-Wave Advantage and D-Wave hybrid solvers to solve the BPP, surpassing the performance of the slack variables approach by achieving solutions for up to 29 items, whereas the slack variables approach only handles up to 11 items. This new approach can be used to solve combinatorial problems with inequality constraints with a reduced number of resources compared to the slack variables approach using quantum annealing or variational quantum algorithms.
- 1 April 2024
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 9 (2) , 025022
Top Cited PapersOpen AccessUnbalanced penalization: a new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
Solving combinatorial optimization problems of the kind that can be codified by quadratic unconstrained binary optimization (QUBO) is a promising application of quantum computation. Some problems of this class suitable for practical applications such as the traveling salesman problem (TSP), the bin packing problem (BPP), or the knapsack problem (KP) have inequality constraints that require a particular cost function encoding. The common approach is the use of slack variables to represent the inequality constraints in the cost function. However, the use of slack variables considerably increases the number of qubits and operations required to solve these problems using quantum devices. In this work, we present an alternative method that does not require extra slack variables and consists of using an unbalanced penalization function to represent the inequality constraints in the QUBO. This function is characterized by larger penalization when the inequality constraint is not achieved than when it is. We evaluate our approach on the TSP, BPP, and KP, successfully encoding the optimal solution of the original optimization problem near the ground state cost Hamiltonian. Additionally, we employ D-Wave Advantage and D-Wave hybrid solvers to solve the BPP, surpassing the performance of the slack variables approach by achieving solutions for up to 29 items, whereas the slack variables approach only handles up to 11 items. This new approach can be used to solve combinatorial problems with inequality constraints with a reduced number of resources compared to the slack variables approach using quantum annealing or variational quantum algorithms.