Sebastián Vidal Romero
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sebastián Vidal Romero has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Yue Ban
CSIC
9 shared publications - Alejandro Gomez Cadavid
Kipu Quantum GmbH, Berlin, Germany
7 shared publications - Enrique Solano
Kipu Quantum GmbH, Berlin, Germany
7 shared publications - Narendra N. Hegade
Kipu Quantum GmbH, Berlin, Germany
7 shared publications - Xi Chen
CSIC
7 shared publications - Anton Simen
Kipu Quantum GmbH Greifswalderstrasse 212 10405 Berlin Germany
4 shared publications
Latest Publications
- 23 June 2026
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 137 (5)
Kicked-Ising quantum battery
- 23 June 2026
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 137 (5)
Kicked-Ising quantum battery
- Top Cited PapersOpen Access
- 13 March 2026
- Published by Springer Nature in npj Quantum Information
- Vol. 12 (1)
Digitized counterdiabatic quantum critical dynamics
We experimentally demonstrate that a digitized counterdiabatic quantum protocol reduces the number of topological defects created during a fast quench across a quantum phase transition. To show this, we perform quantum simulations of one- and two-dimensional transverse-field Ising models driven from the paramagnetic to the ferromagnetic phase. We utilize superconducting cloud-based quantum processors with up to 156 qubits. Our data reveal that the digitized counterdiabatic protocol reduces defect formation by up to 48% in the fast-quench regime–an improvement hard to achieve through digitized quantum annealing under current noise levels. The experimental results closely match theoretical and numerical predictions at short evolution times before deviating at longer times due to hardware noise. In one dimension, we derive an analytic solution for the defect number distribution in the fast-quench limit. For two-dimensional geometries, where analytical solutions are unknown and numerical simulations are challenging, we use advanced matrix product state methods. Our findings indicate a practical way to control topological defect formation during fast quenches and highlight the utility of counterdiabatic protocols for quantum optimization and quantum simulation in material design on current quantum processors.
- 13 March 2026
- Published by Springer Nature in npj Quantum Information
- Vol. 12 (1)
Top Cited PapersOpen AccessDigitized counterdiabatic quantum critical dynamics
We experimentally demonstrate that a digitized counterdiabatic quantum protocol reduces the number of topological defects created during a fast quench across a quantum phase transition. To show this, we perform quantum simulations of one- and two-dimensional transverse-field Ising models driven from the paramagnetic to the ferromagnetic phase. We utilize superconducting cloud-based quantum processors with up to 156 qubits. Our data reveal that the digitized counterdiabatic protocol reduces defect formation by up to 48% in the fast-quench regime–an improvement hard to achieve through digitized quantum annealing under current noise levels. The experimental results closely match theoretical and numerical predictions at short evolution times before deviating at longer times due to hardware noise. In one dimension, we derive an analytic solution for the defect number distribution in the fast-quench limit. For two-dimensional geometries, where analytical solutions are unknown and numerical simulations are challenging, we use advanced matrix product state methods. Our findings indicate a practical way to control topological defect formation during fast quenches and highlight the utility of counterdiabatic protocols for quantum optimization and quantum simulation in material design on current quantum processors.
- 22 February 2026
- Published by Wiley in Expert Systems
- Vol. 43 (4)
On the Transfer of Knowledge in Quantum Algorithms
Quantum computing is poised to transform computational paradigms across science and industry. As the field evolves, it can benefit from established classical methodologies, including promising paradigms such as Transfer of Knowledge (ToK). This work serves as a brief, self‐contained reference for ToK, unifying its core principles under a single formal framework. We introduce a joint notation that consolidates and extends prior work in Transfer Learning and Transfer Optimisation, bridging traditionally separate research lines and enabling a common language for knowledge reuse. Building on this foundation, we classify existing ToK strategies and principles into a structured taxonomy that helps researchers position their methods within a broader conceptual map. We then extend key transfer protocols to quantum computing, introducing two novel use cases—reverse annealing and multitasking Quantum Approximate Optimization Algorithm (QAOA)—alongside a sequential Variational Quantum Eigensolver (VQE) approach that supports and validates prior findings. These examples highlight ToK's potential to improve performance and generalisation in quantum algorithms. Finally, we outline challenges and opportunities for integrating ToK into quantum computing, emphasising its role in reducing resource demands and accelerating problem‐solving. This work lays the groundwork for future synergies between classical and quantum computing through a shared, transferable knowledge framework.
- 22 February 2026
- Published by Wiley in Expert Systems
- Vol. 43 (4)
On the Transfer of Knowledge in Quantum Algorithms
Quantum computing is poised to transform computational paradigms across science and industry. As the field evolves, it can benefit from established classical methodologies, including promising paradigms such as Transfer of Knowledge (ToK). This work serves as a brief, self‐contained reference for ToK, unifying its core principles under a single formal framework. We introduce a joint notation that consolidates and extends prior work in Transfer Learning and Transfer Optimisation, bridging traditionally separate research lines and enabling a common language for knowledge reuse. Building on this foundation, we classify existing ToK strategies and principles into a structured taxonomy that helps researchers position their methods within a broader conceptual map. We then extend key transfer protocols to quantum computing, introducing two novel use cases—reverse annealing and multitasking Quantum Approximate Optimization Algorithm (QAOA)—alongside a sequential Variational Quantum Eigensolver (VQE) approach that supports and validates prior findings. These examples highlight ToK's potential to improve performance and generalisation in quantum algorithms. Finally, we outline challenges and opportunities for integrating ToK into quantum computing, emphasising its role in reducing resource demands and accelerating problem‐solving. This work lays the groundwork for future synergies between classical and quantum computing through a shared, transferable knowledge framework.
- Open Access
Kicked-Ising Quantum Battery
Quantum batteries (QBs) have emerged as promising candidates capable of outperforming classical counterparts by utilizing entangled operators. Spin chains, in particular, exhibit unique {charging} properties across diverse settings. Here, we introduce the kicked-Ising model as a QB and analytically characterize its charging dynamics within the self-dual operator regime, valid for arbitrary system sizes and Floquet cycles. Using Clifford quantum cellular automata and momentum-space Floquet analysis with the Cayley-Hamilton theorem, we obtain exact expressions for energy injection, uncovering the influence of boundary conditions and spin-chain parity on charging performance. The kicked-Ising QB achieves maximal charging while exhibiting remarkable robustness against disorder. We further propose an intensified protocol within a fixed time window that enables faster and more efficient energy injection, while non-uniform kick schedules enhance experimental flexibility. Spin correlators analysis further shows that low-frequency driving boosts energy injection, highlighting a clear connection between charging, scrambling, and kick-induced delocalization. Our theoretical framework are supported by tensor-network simulations and finally verified on IBM quantum hardware. Accounting for platform-specific constraints, we demonstrate that the kicked-Ising QB offers a scalable, disorder-resilient protocol and testbed to assess quantum platforms.
Open AccessKicked-Ising Quantum Battery
Quantum batteries (QBs) have emerged as promising candidates capable of outperforming classical counterparts by utilizing entangled operators. Spin chains, in particular, exhibit unique {charging} properties across diverse settings. Here, we introduce the kicked-Ising model as a QB and analytically characterize its charging dynamics within the self-dual operator regime, valid for arbitrary system sizes and Floquet cycles. Using Clifford quantum cellular automata and momentum-space Floquet analysis with the Cayley-Hamilton theorem, we obtain exact expressions for energy injection, uncovering the influence of boundary conditions and spin-chain parity on charging performance. The kicked-Ising QB achieves maximal charging while exhibiting remarkable robustness against disorder. We further propose an intensified protocol within a fixed time window that enables faster and more efficient energy injection, while non-uniform kick schedules enhance experimental flexibility. Spin correlators analysis further shows that low-frequency driving boosts energy injection, highlighting a clear connection between charging, scrambling, and kick-induced delocalization. Our theoretical framework are supported by tensor-network simulations and finally verified on IBM quantum hardware. Accounting for platform-specific constraints, we demonstrate that the kicked-Ising QB offers a scalable, disorder-resilient protocol and testbed to assess quantum platforms.
- Open Access
Hybrid Sequential Quantum Computing
We introduce hybrid sequential quantum computing (HSQC), a paradigm for combinatorial optimization that systematically integrates classical and quantum methods within a structured, stage-wise workflow. HSQC may involve an arbitrary sequence of classical and quantum processes, as long as the global result outperforms the standalone components. Our testbed begins with classical optimizers to explore the solution landscape, followed by quantum optimization to refine candidate solutions, and concludes with classical solvers to recover nearby or exact-optimal states. We demonstrate two instantiations: (i) a pipeline combining simulated annealing (SA), bias-field digitized counterdiabatic quantum optimization (BF-DCQO), and memetic tabu search (MTS); and (ii) a variant combining SA, BF-DCQO, and a second round of SA. This workflow design is motivated by the complementary strengths of each component. Classical heuristics efficiently find low-energy configurations, but often get trapped in local minima. BF-DCQO exploits quantum resources to tunnel through these barriers and improve solution quality. Due to decoherence and approximations, BF-DCQO may not always yield optimal results. Thus, the best quantum-enhanced state is used to continue with a final classical refinement stage. Applied to challenging higher-order unconstrained binary optimization (HUBO) problems on a 156-qubit heavy-hexagonal superconducting quantum processor, we show that HSQC consistently recovers ground-state solutions in just a few seconds. Compared to standalone classical solvers, HSQC achieves a speedup of up to 700 times over SA and up to 9 times over MTS in estimated runtimes. These results demonstrate that HSQC provides a flexible and scalable framework capable of delivering up to two orders of magnitude improvement at runtime quantum-advantage level on advanced commercial quantum processors.
Open AccessHybrid Sequential Quantum Computing
We introduce hybrid sequential quantum computing (HSQC), a paradigm for combinatorial optimization that systematically integrates classical and quantum methods within a structured, stage-wise workflow. HSQC may involve an arbitrary sequence of classical and quantum processes, as long as the global result outperforms the standalone components. Our testbed begins with classical optimizers to explore the solution landscape, followed by quantum optimization to refine candidate solutions, and concludes with classical solvers to recover nearby or exact-optimal states. We demonstrate two instantiations: (i) a pipeline combining simulated annealing (SA), bias-field digitized counterdiabatic quantum optimization (BF-DCQO), and memetic tabu search (MTS); and (ii) a variant combining SA, BF-DCQO, and a second round of SA. This workflow design is motivated by the complementary strengths of each component. Classical heuristics efficiently find low-energy configurations, but often get trapped in local minima. BF-DCQO exploits quantum resources to tunnel through these barriers and improve solution quality. Due to decoherence and approximations, BF-DCQO may not always yield optimal results. Thus, the best quantum-enhanced state is used to continue with a final classical refinement stage. Applied to challenging higher-order unconstrained binary optimization (HUBO) problems on a 156-qubit heavy-hexagonal superconducting quantum processor, we show that HSQC consistently recovers ground-state solutions in just a few seconds. Compared to standalone classical solvers, HSQC achieves a speedup of up to 700 times over SA and up to 9 times over MTS in estimated runtimes. These results demonstrate that HSQC provides a flexible and scalable framework capable of delivering up to two orders of magnitude improvement at runtime quantum-advantage level on advanced commercial quantum processors.
- Open Access
- 23 August 2025
- Published by Springer Nature in Communications Physics
- Vol. 8 (1) , 1-12
Bias-field digitized counterdiabatic quantum algorithm for higher-order binary optimization
Combinatorial optimization plays a crucial role in many industrial applications. While classical computing often struggles with complex instances, quantum optimization emerges as a promising alternative. Here, we present an enhanced bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm to address higher-order unconstrained binary optimization (HUBO). We apply BF-DCQO to a HUBO problem featuring three-local terms in the Ising spin-glass model, validated experimentally using 156 qubits on an IBM quantum processor. In the studied instances, our results outperform standard methods such as the quantum approximate optimization algorithm, quantum annealing, simulated annealing, and Tabu search. Furthermore, we provide numerical evidence of the feasibility of a similar HUBO problem on a 433-qubit Osprey-like quantum processor. Finally, we solve denser instances of the MAX 3-SAT problem in an IonQ emulator. Our results show that BF-DCQO offers an effective path for solving large-scale HUBO problems on current and near-term quantum processors.
- 23 August 2025
- Published by Springer Nature in Communications Physics
- Vol. 8 (1) , 1-12
Open AccessBias-field digitized counterdiabatic quantum algorithm for higher-order binary optimization
Combinatorial optimization plays a crucial role in many industrial applications. While classical computing often struggles with complex instances, quantum optimization emerges as a promising alternative. Here, we present an enhanced bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm to address higher-order unconstrained binary optimization (HUBO). We apply BF-DCQO to a HUBO problem featuring three-local terms in the Ising spin-glass model, validated experimentally using 156 qubits on an IBM quantum processor. In the studied instances, our results outperform standard methods such as the quantum approximate optimization algorithm, quantum annealing, simulated annealing, and Tabu search. Furthermore, we provide numerical evidence of the feasibility of a similar HUBO problem on a 433-qubit Osprey-like quantum processor. Finally, we solve denser instances of the MAX 3-SAT problem in an IonQ emulator. Our results show that BF-DCQO offers an effective path for solving large-scale HUBO problems on current and near-term quantum processors.
- Open Access
- 11 August 2025
- Published by Springer Nature in EPJ Quantum Technology
- Vol. 12 (1) , 1-20
Digitized counterdiabatic quantum optimization for bin packing problem
The bin packing problem (BPP), a classical NP-hard combinatorial optimization challenge, has emerged as a promising application for quantum computing. In this work, we tackle the one-dimensional BPP (1dBPP) using a digitized counterdiabatic quantum approximate optimization algorithm (DC-QAOA) that incorporates counterdiabatic (CD) driving to achieve a 40% higher feasibility ratio than standard QAOA, while reducing quantum resource requirements. We investigate three ansatz schemes -DC-QAOA, CD-inspired ansatz, and CD-mixer ansatz - each integrating CD terms with distinct combinations of cost and mixer Hamiltonians, resulting in different DC-QAOA variants. Numerical simulations demonstrate that these DC-QAOA variants maintain solution accuracy with less than 5% variance across varying iteration numbers, circuit depths, and Hamiltonian step sizes. Moreover, they require approximately 7 to 8 times fewer measurements to achieve comparable precision under the same parameter variations. Experimental validation on a 10-item 1dBPP instance using IBM quantum computers shows the CD-mixer ansatz achieves five times more feasibility solutions and greater robustness against NISQ noise. Collectively, these results establish DC-QAOA as a resource-efficient framework for combinatorial optimization on near-term quantum devices.
- 11 August 2025
- Published by Springer Nature in EPJ Quantum Technology
- Vol. 12 (1) , 1-20
Open AccessDigitized counterdiabatic quantum optimization for bin packing problem
The bin packing problem (BPP), a classical NP-hard combinatorial optimization challenge, has emerged as a promising application for quantum computing. In this work, we tackle the one-dimensional BPP (1dBPP) using a digitized counterdiabatic quantum approximate optimization algorithm (DC-QAOA) that incorporates counterdiabatic (CD) driving to achieve a 40% higher feasibility ratio than standard QAOA, while reducing quantum resource requirements. We investigate three ansatz schemes -DC-QAOA, CD-inspired ansatz, and CD-mixer ansatz - each integrating CD terms with distinct combinations of cost and mixer Hamiltonians, resulting in different DC-QAOA variants. Numerical simulations demonstrate that these DC-QAOA variants maintain solution accuracy with less than 5% variance across varying iteration numbers, circuit depths, and Hamiltonian step sizes. Moreover, they require approximately 7 to 8 times fewer measurements to achieve comparable precision under the same parameter variations. Experimental validation on a 10-item 1dBPP instance using IBM quantum computers shows the CD-mixer ansatz achieves five times more feasibility solutions and greater robustness against NISQ noise. Collectively, these results establish DC-QAOA as a resource-efficient framework for combinatorial optimization on near-term quantum devices.
- Open Access
Sequential Quantum Computing
We propose and experimentally demonstrate sequential quantum computing (SQC), a paradigm that utilizes multiple homogeneous or heterogeneous quantum processors in hybrid classical-quantum workflows. In this manner, we are able to overcome the limitations of each type of quantum computer by combining their complementary strengths. Current quantum devices, including analog quantum annealers and digital quantum processors, offer distinct advantages, yet face significant practical constraints when individually used. SQC addresses this by efficient inter-processor transfer of information through bias fields. Consequently, measurement outcomes from one quantum processor are encoded in the initial-state preparation of the subsequent quantum computer. We experimentally validate SQC by solving a combinatorial optimization problem with interactions up to three-body terms. A D-Wave quantum annealer utilizing 678 qubits approximately solves the problem, and an IBM's 156-qubit digital quantum processor subsequently refines the obtained solutions. This is possible via the digital introduction of non-stoquastic counterdiabatic terms unavailable to the analog quantum annealer. The experiment shows a substantial reduction in computational resources and improvement in the quality of the solution compared to the standalone operations of the individual quantum processors. These results highlight SQC as a powerful and versatile approach for addressing complex combinatorial optimization problems, with potential applications in quantum simulation of many-body systems, quantum chemistry, among others.
Open AccessSequential Quantum Computing
We propose and experimentally demonstrate sequential quantum computing (SQC), a paradigm that utilizes multiple homogeneous or heterogeneous quantum processors in hybrid classical-quantum workflows. In this manner, we are able to overcome the limitations of each type of quantum computer by combining their complementary strengths. Current quantum devices, including analog quantum annealers and digital quantum processors, offer distinct advantages, yet face significant practical constraints when individually used. SQC addresses this by efficient inter-processor transfer of information through bias fields. Consequently, measurement outcomes from one quantum processor are encoded in the initial-state preparation of the subsequent quantum computer. We experimentally validate SQC by solving a combinatorial optimization problem with interactions up to three-body terms. A D-Wave quantum annealer utilizing 678 qubits approximately solves the problem, and an IBM's 156-qubit digital quantum processor subsequently refines the obtained solutions. This is possible via the digital introduction of non-stoquastic counterdiabatic terms unavailable to the analog quantum annealer. The experiment shows a substantial reduction in computational resources and improvement in the quality of the solution compared to the standalone operations of the individual quantum processors. These results highlight SQC as a powerful and versatile approach for addressing complex combinatorial optimization problems, with potential applications in quantum simulation of many-body systems, quantum chemistry, among others.
- Open Access
Protein folding with an all-to-all trapped-ion quantum computer
We experimentally demonstrate that the bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm, implemented on IonQ's fully connected trapped-ion quantum processors, offers an efficient approach to solving dense higher-order unconstrained binary optimization (HUBO) problems. Specifically, we tackle protein folding on a tetrahedral lattice for up to 12 amino acids, representing the largest quantum hardware implementations of protein folding problems reported to date. Additionally, we address MAX 4-SAT instances at the computational phase transition and fully connected spin-glass problems using all 36 available qubits. Across all considered cases, our method consistently achieves optimal solutions, highlighting the powerful synergy between non-variational quantum optimization approaches and the intrinsic all-to-all connectivity of trapped-ion architectures. Given the expected scalability of trapped-ion quantum systems, BF-DCQO represents a promising pathway toward practical quantum advantage for dense HUBO problems with significant industrial and scientific relevance.
Open AccessProtein folding with an all-to-all trapped-ion quantum computer
We experimentally demonstrate that the bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm, implemented on IonQ's fully connected trapped-ion quantum processors, offers an efficient approach to solving dense higher-order unconstrained binary optimization (HUBO) problems. Specifically, we tackle protein folding on a tetrahedral lattice for up to 12 amino acids, representing the largest quantum hardware implementations of protein folding problems reported to date. Additionally, we address MAX 4-SAT instances at the computational phase transition and fully connected spin-glass problems using all 36 available qubits. Across all considered cases, our method consistently achieves optimal solutions, highlighting the powerful synergy between non-variational quantum optimization approaches and the intrinsic all-to-all connectivity of trapped-ion architectures. Given the expected scalability of trapped-ion quantum systems, BF-DCQO represents a promising pathway toward practical quantum advantage for dense HUBO problems with significant industrial and scientific relevance.
- Open Access
Runtime Quantum Advantage with Digital Quantum Optimization
We demonstrate experimentally that the bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm on IBM's 156-qubit devices can outperform simulated annealing (SA) and CPLEX in time-to-approximate solutions for specific higher-order unconstrained binary optimization (HUBO) problems. We suitably select problem instances that are challenging for classical methods, running in fractions of minutes even with multicore processors. On the other hand, our counterdiabatic quantum algorithms obtain similar or better results in at most a few seconds on quantum hardware, achieving runtime quantum advantage. Our analysis reveals that the performance improvement becomes increasingly evident as the system size grows. Given the rapid progress in quantum hardware, we expect that this improvement will become even more pronounced, potentially leading to a quantum advantage of several orders of magnitude. Our results indicate that available digital quantum processors, when combined with specific-purpose quantum algorithms, exhibit a runtime quantum advantage even in the absence of quantum error correction.
Open AccessRuntime Quantum Advantage with Digital Quantum Optimization
We demonstrate experimentally that the bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm on IBM's 156-qubit devices can outperform simulated annealing (SA) and CPLEX in time-to-approximate solutions for specific higher-order unconstrained binary optimization (HUBO) problems. We suitably select problem instances that are challenging for classical methods, running in fractions of minutes even with multicore processors. On the other hand, our counterdiabatic quantum algorithms obtain similar or better results in at most a few seconds on quantum hardware, achieving runtime quantum advantage. Our analysis reveals that the performance improvement becomes increasingly evident as the system size grows. Given the rapid progress in quantum hardware, we expect that this improvement will become even more pronounced, potentially leading to a quantum advantage of several orders of magnitude. Our results indicate that available digital quantum processors, when combined with specific-purpose quantum algorithms, exhibit a runtime quantum advantage even in the absence of quantum error correction.