Let K be an algebraically closed field of characteristic zero, and let G be a connected reductive algebraic group over K. We address the problem of classifying triples (G, H, V ), where H is a proper connected subgroup of G, and V is a finitedimensional ir ...
Mechanical oscillators can exhibit modes with ultra-low energy dissipation and compact form factors due to the slow velocity of acoustic waves, and are already used in applications ranging from timing to wireless filters. Over the past decade, novel ways i ...
Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. Access to a computational space that incorporates quantum effects, such as superposition ...
Quantum computers have the potential to surpass conventional computing, but they are hindered by noise which induces errors that ultimately lead to the loss of quantum information. This necessitates the development of quantum error correction strategies fo ...
Advancing quantum technologies depends on the precise control of individual quantum systems, the so-called qubits, and the exploitation of their quantum properties. Nowadays, expanding the number of qubits to be entangled is at the core of the developments ...
In this thesis, we give new protocols that offer a quantum advantage for problems in ML, Physics, and Finance.
Quantum mechanics gives predictions that are inconsistent with local realism.
The experiment proving this fact (Bell, 1964) gives a quantum proto ...
We determine the dimensions of Ext -groups between simple modules and dual generalized Verma modules in singular blocks of parabolic versions of category O for complex semisimple Lie algebras and affine Kac-Moody algebras. ...
Ulam asked whether all Lie groups can be represented faithfully on a countable set. We establish a reduction of Ulam's problem to the case of simple Lie groups. In particular, we solve the problem for all solvable Lie groups and more generally Lie groups w ...
Many problems in robotics are fundamentally problems of geometry, which have led to an increased research effort in geometric methods for robotics in recent years. The results were algorithms using the various frameworks of screw theory, Lie algebra, and d ...
Quantum computing has made significant progress in recent years, with Google and IBM releasing quantum computers with 72 and 50 qubits, respectively. Google has also achieved quantum supremacy with its 54-qubit device, and IBM has announced the release of ...
Quantum many-body control is a central milestone en route to harnessing quantum technologies. However, the exponential growth of the Hilbert space dimension with the number of qubits makes it challenging to classically simulate quantum many-body systems an ...
The task of learning a quantum circuit to prepare a given mixed state is a fundamental quantum subroutine. We present a variational quantum algorithm (VQA) to learn mixed states which is suitable for near-term hardware. Our algorithm represents a generaliz ...
A crucial milestone in the field of quantum simulation and computation is to demonstrate that a quantum device can perform a computation task that is classically intractable. A key question is to identify setups that can achieve such goal within current te ...
The magnetic propertiesof transition-metal ions aregenerallydescribed by the atomic spins of the ions and their exchange coupling.The orbital moment, usually largely quenched due the ligand field,is then seen as a perturbation. In such a scheme, S = 1/2 io ...
An enduring challenge in constructing mechanical-oscillator-based hybrid quantum systems is to ensure engineered coupling to an auxiliary degree of freedom and maintain good mechanical isolation from the environment, that is, low quantum decoherence, consi ...
The variational approach is a cornerstone of computational physics, considering both conventional and quantum computing computational platforms. The variational quantum eigensolver algorithm aims to prepare the ground state of a Hamiltonian exploiting para ...
Quantum computation (QC) is one of the most challenging quantum technologies that promise to revolutionize data computation in the long-term by outperforming the classical supercomputers in specific applications. Errors will hamper this quantum revolution ...
Let G be either a simple linear algebraic group over an algebraically closed field of characteristic l>0 or a quantum group at an l-th root of unity. The category Rep(G) of finite-dimensional G-modules is non-semisimple. In this thesis, we develop new tech ...
Ulam asked whether every connected Lie group can be represented on a countable structure. This is known in the linear case. We establish it for the first family of non-linear groups, namely in the nilpotent case. Further context is discussed to illustrate ...
Encouraging a modal shift from individual transportation to less polluting modes such as public transport, walking and cycling, is now a key recommendation of the UN to reach the goals set by the Paris Agreement. Achieving this ambitious goal requires a de ...
