Elias Zapusek

Elias Zapusek

Auto-generated profile, based on publicly available information

Elias Zapusek

Institute for Quantum Electronics, ETH Zürich, 8093 Zürich, Switzerland

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 September 2024 in Physical Review A
Verified
Journal Article
Closed access
PDF file
TMT. Muser
T. Muser
EZE. Zapusek
E. Zapusek
VBV. Belis
V. Belis
FRF. Reiter
F. Reiter
There is an ongoing effort to find quantum speedups for learning problems. Recently [Y. Liu et al., Nat. Phys. 17, 1013 (2021)] proved an exponential speedup for quantum support vector machines by leveraging the speedup of Shor's algorithm. We expand upon this result and identify a speedup utilizing Grover's algorithm in the kernel of a support vector machine. To show the practicality of the kernel structure we apply it to a problem related to pattern matching, providing a practical yet provable advantage. Moreover, we show that combining quantum computation in a preprocessing step with classical methods for classification further improves classifier performance.

13 March 2026 in Physical Review X
Verified
Journal Article
Open access
IRIvan Rojkov
Ivan Rojkov
MSMatteo Simoni
Matteo Simoni
EZElias Zapusek
Elias Zapusek
FRFlorentin Reiter
Florentin Reiter
Jonathan HomeJonathan Home
Jonathan Home
We introduce a novel reservoir engineering approach for stabilizing multicomponent Schrödinger’s cat manifolds. The fundamental principle of the method lies in the destructive interference at crossings of gain and loss Hamiltonian terms in the coupling of an oscillator to a zero-temperature auxiliary system, which are nonlinear with respect to the oscillator’s energy. The nature of these gain and loss terms is found to determine the rotational symmetry, energy distributions, and degeneracy of the resulting stabilized manifolds. Considering these systems as bosonic error-correction codes, we analyze their properties with respect to a variety of errors, including both autonomous and passive error correction, where we find that our formalism gives straightforward insights into the nature of the correction. We give example implementations using the anharmonic laser-ion coupling of a trapped ion outside the Lamb-Dicke regime as well as nonlinear superconducting circuits. Beyond the dissipative stabilization of standard cat manifolds and novel rotation symmetric codes, we demonstrate that our formalism allows for the stabilization of bosonic codes linked to cat states through unitary transformations, such as quadrature-squeezed cats. Our work establishes a design approach for creating and utilizing codes using nonlinearity, providing access to novel quantum states and processes across a range of physical systems.

2 November 2022 in Quantum Science and Technology
Verified
Journal Article
Open access
EZElias Zapusek
Elias Zapusek
AJAlisa Javadi
Alisa Javadi
FRFlorentin Reiter
Florentin Reiter
Irreversible logic is at odds with unitary quantum evolution. Emulating such operations by classical measurements can result in disturbances and high resource demands. To overcome these limitations, we propose protocols that harness dissipation to realize the nonunitary evolution required for irreversible gate operations. Using additional excited states subject to decay, we engineer effective decay processes that perform the desired gate operations on the smallest stable Hilbert space. These operate deterministically and in an autonomous fashion, without the need for measurements. We exemplify our approach considering several classical logic operations, such as the OR, NOR, and XOR gates. Towards experimental realization, we discuss a possible implementation in quantum dots. Our study shows that irreversible logic operations can be efficiently performed on realistic quantum systems and that dissipation engineering is an essential tool for obtaining nonunitary evolutions. The proposed operations expand the quantum engineers’ toolbox and have promising applications in NISQ algorithms and quantum machine learning.

20 February 2026 in Quantum Science and Technology
Verified
Journal Article
Open access
EZElias Zapusek
Elias Zapusek
KKKristina Kirova
Kristina Kirova
WHWalter Hahn
Walter Hahn
MMMichael Marthaler
Michael Marthaler
FRFlorentin Reiter
Florentin Reiter
We propose incorporating multi-qubit nonunitary operations in variational quantum thermalizers (VQTs). VQTs are hybrid quantum–classical algorithms that generate the thermal (Gibbs) state of a given Hamiltonian, with applications in quantum algorithms and simulations. However, current algorithms struggle at intermediate temperatures, where the target state is nonpure but exhibits entanglement. We devise multi-qubit nonunitary operations that harness weak symmetries and thereby improve the performance of the algorithm. Utilizing dissipation engineering, we create these nonunitary multi-qubit operations without the need for measurements or additional qubits. To train the ansatz, we develop and benchmark novel methods for entropy estimation of quantum states, expanding the toolbox for quantum state characterization. We demonstrate that our approach can prepare thermal states of paradigmatic spin models at all temperatures. Our work thus creates new opportunities for simulating open quantum many-body systems.

25 September 2023 in arXiv
Verified
Preprint
Open access
PDF file
TMTill Muser
Till Muser
EZElias Zapusek
Elias Zapusek
VBVasilis Belis
Vasilis Belis
FRFlorentin Reiter
Florentin Reiter
There is an ongoing effort to find quantum speedups for learning problems. Recently, [Y. Liu et al., Nat. Phys. $\textbf{17}$, 1013--1017 (2021)] have proven an exponential speedup for quantum support vector machines by leveraging the speedup of Shor's algorithm. We expand upon this result and identify a speedup utilizing Grover's algorithm in the kernel of a support vector machine. To show the practicality of the kernel structure we apply it to a problem related to pattern matching, providing a practical yet provable advantage. Moreover, we show that combining quantum computation in a preprocessing step with classical methods for classification further improves classifier performance.