activity
20222025
most citedNear-optimal quantum circuit construction via Cartan decomposition

9 citations · 11 across the 6 of their papers we have counts for

collaborators

6 papers

quant-ph2025

Solving graph problems using permutation-invariant quantum machine learning

Maximilian Balthasar Mansky, Tobias Rohe, Gerhard Stenzel +7

Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In qua…

quant-ph2024★ 1 cited

Scaling of symmetry-restricted quantum circuits

Maximilian Balthasar Mansky, Miguel Armayor Martinez, Alejandro Bravo de la Serna +6

The intrinsic symmetries of physical systems have been employed to reduce the number of degrees of freedom of systems, thereby simplifying computations. In this work, we investigat…

quant-ph2024

Symmetry-restricted quantum circuits are still well-behaved

Maximilian Balthasar Mansky, Santiago Londoño Castillo, Miguel Armayor-Martínez +5

We show that quantum circuits restricted by a symmetry inherit the properties of the whole special unitary group , in particular composition, algebraic and topological clo…

quant-ph2023★ 1 cited

Permutation-invariant quantum circuits

Maximilian Balthasar Mansky, Santiago Londoño Castillo, Victor Ramos Puigvert +1

The implementation of physical symmetries into problem descriptions allows for the reduction of parameters and computational complexity. We show the integration of the permutation…

quant-ph2023

Decomposition Algorithm of an Arbitrary Pauli Exponential through a Quantum Circuit

Maximilian Balthasar Mansky, Victor Ramos Puigvert, Santiago Londoño Castillo +1

We review the staircase algorithm to decompose the exponential of a generalized Pauli matrix and we propose two alternative recursive methods which offer more efficient quantum cir…

quant-ph2022★ 9 cited

Near-optimal quantum circuit construction via Cartan decomposition

Maximilian Balthasar Mansky, Santiago Londoño Castillo, Victor Ramos Puigvert +1

We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits. This approach can be used to synthesize circuits that can efficiently implement any desir…