Florian Dreier
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Florian Dreier has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Maike Drieb-Schön
University of Innsbruck
1 shared publication - Markus Haltmeier
Universität Innsbruck
1 shared publication Wolfgang Lechner
Institute for Theoretical Physics, University of Innsbruck , Innsbruck A-6020, and , Innsbruck A-6020
1 shared publication- Wolfgang Lechner
University of Innsbruck
1 shared publication
Latest Publications
- Open Access
- 1 July 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (1)
Bundling of bipartite entanglement
We investigate bipartite entanglement and prove that in constrained energy subspaces, the entanglement spectra of multiple bipartitions are the same across the whole subspace. We show that in quantum many-body systems the bipartite entanglement entropy is affected in such a way that it forms “bundles” under unitary time evolution. Leveraging the structure of the subspace, we present methods to verify whether the entanglement spectrum of two bipartitions is identical throughout the entire subspace. For the subspace defined by the parity embedding, we further provide an algorithm that can determine this in polynomial time.
- 1 July 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (1)
Open AccessBundling of bipartite entanglement
We investigate bipartite entanglement and prove that in constrained energy subspaces, the entanglement spectra of multiple bipartitions are the same across the whole subspace. We show that in quantum many-body systems the bipartite entanglement entropy is affected in such a way that it forms “bundles” under unitary time evolution. Leveraging the structure of the subspace, we present methods to verify whether the entanglement spectrum of two bipartitions is identical throughout the entire subspace. For the subspace defined by the parity embedding, we further provide an algorithm that can determine this in polynomial time.
- 1 February 2026
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 67 (2)
On the uniqueness of compiling graphs under the parity transformation
In this article, we establish a mathematical framework that utilizes concepts from graph theory to formalize the parity transformation, an encoding strategy for compiling optimization problems on quantum devices. We introduce the transformation as a mapping that encompasses all possible compiled hypergraphs and investigate its uniqueness properties in more detail. Specifically, by introducing so-called loop labelings, we derive an alternative expression of the preimage of any set of compiled hypergraphs under this encoding procedure when all equivalence classes of graphs are being considered. We then deduce equivalent conditions for the injectivity of the parity transformation on any subset of all equivalences classes of graphs. Through concrete examples, we demonstrate that the parity transformation is not an injective mapping, and also introduce an important class of physical layouts and their corresponding set of constraints whose preimage is uniquely determined. In addition, we provide an algorithm which is based on classical algorithms from theoretical computer science and computes a compiled physical layout in this class in polynomial time.
- 1 February 2026
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 67 (2)
On the uniqueness of compiling graphs under the parity transformation
In this article, we establish a mathematical framework that utilizes concepts from graph theory to formalize the parity transformation, an encoding strategy for compiling optimization problems on quantum devices. We introduce the transformation as a mapping that encompasses all possible compiled hypergraphs and investigate its uniqueness properties in more detail. Specifically, by introducing so-called loop labelings, we derive an alternative expression of the preimage of any set of compiled hypergraphs under this encoding procedure when all equivalence classes of graphs are being considered. We then deduce equivalent conditions for the injectivity of the parity transformation on any subset of all equivalences classes of graphs. Through concrete examples, we demonstrate that the parity transformation is not an injective mapping, and also introduce an important class of physical layouts and their corresponding set of constraints whose preimage is uniquely determined. In addition, we provide an algorithm which is based on classical algorithms from theoretical computer science and computes a compiled physical layout in this class in polynomial time.
- Open Access
- 16 June 2022
- Published by IOP Publishing in Inverse Problems
- Vol. 38 (8) , 085004
Photoacoustic inversion formulas using mixed data on finite time intervals*
We study the inverse source problem in photoacoustic tomography (PAT) for mixed data, which denote a weighted linear combination of the acoustic pressure and its normal derivative on an observation surface. We consider in particular the case where the data are only available on finite time intervals, which accounts for real-world usage of PAT where data are only feasible within a certain time interval. Extending our previous work, we derive explicit formulas up to a smoothing integral on convex domains with a smooth boundary, yielding exact reconstruction for circular or elliptical domains. We also present numerical reconstructions of our new exact inversion formulas on finite time intervals and compare them with the reconstructions of our previous formulas for unlimited time wave measurements.
- 16 June 2022
- Published by IOP Publishing in Inverse Problems
- Vol. 38 (8) , 085004
Open AccessPhotoacoustic inversion formulas using mixed data on finite time intervals*
We study the inverse source problem in photoacoustic tomography (PAT) for mixed data, which denote a weighted linear combination of the acoustic pressure and its normal derivative on an observation surface. We consider in particular the case where the data are only available on finite time intervals, which accounts for real-world usage of PAT where data are only feasible within a certain time interval. Extending our previous work, we derive explicit formulas up to a smoothing integral on convex domains with a smooth boundary, yielding exact reconstruction for circular or elliptical domains. We also present numerical reconstructions of our new exact inversion formulas on finite time intervals and compare them with the reconstructions of our previous formulas for unlimited time wave measurements.