Franz Georg Fuchs
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Franz Georg Fuchs has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Adil Rasheed
SINTEF ICT, Department of Applied Mathematics, Postboks 4760 Sluppen, NO-7465 Trondheim, Norway
2 shared publications - Alexander Johannes Stasik
Department of Physics, University of Oslo, Oslo, Norway
2 shared publications - Giorgio Sartor
SINTEF Digital
2 shared publications - Mandar Tabib
SINTEF Digital, Mathematics and Cybernetics
2 shared publications Andrea Barth
1 shared publication- Eivind Fonn
Department of Mathematics and Cybernetics, SINTEF DIGITAL, Trondheim, Norway
1 shared publication
Latest Publications
- Open Access
- 10 June 2025
- Published by The Open Journal in Journal of Open Source Software
- Vol. 10 (110) , 7994
QuantumReservoirPy: A Software Package for Time Series Prediction
Reservoir computing on quantum computers has recently emerged as a potential resource for time series prediction, owing to its inherent complex dynamics. To advance Quantum Reservoir Computing (QRC) research, we have developed the Python package QuantumReservoirPy, which facilitates QRC using quantum circuits as reservoirs. The package is designed to be easy to use, while staying completely customizable. The resulting interface, similar to that of reservoirpy (Trouvain et al., 2020), simplifies the development of quantum reservoirs, and provides logical methods of comparison between reservoir architectures.
- 10 June 2025
- Published by The Open Journal in Journal of Open Source Software
- Vol. 10 (110) , 7994
Open AccessQuantumReservoirPy: A Software Package for Time Series Prediction
Reservoir computing on quantum computers has recently emerged as a potential resource for time series prediction, owing to its inherent complex dynamics. To advance Quantum Reservoir Computing (QRC) research, we have developed the Python package QuantumReservoirPy, which facilitates QRC using quantum circuits as reservoirs. The package is designed to be easy to use, while staying completely customizable. The resulting interface, similar to that of reservoirpy (Trouvain et al., 2020), simplifies the development of quantum reservoirs, and provides logical methods of comparison between reservoir architectures.
- Open Access
- 25 November 2024
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 8, 1535
LX-mixers for QAOA: Optimal mixers restricted to subspaces and the stabilizer formalism
We present a novel formalism to both understand and construct mixers that preserve a given subspace. The method connects and utilizes the stabilizer formalism that is used in error correcting codes. This can be useful in the setting when the quantum approximate optimization algorithm (QAOA), a popular meta-heuristic for solving combinatorial optimization problems, is applied in the setting where the constraints of the problem lead to a feasible subspace that is large but easy to specify. The proposed method gives a systematic way to construct mixers that are resource efficient in the number of controlled not gates and can be understood as a generalization of the well-known X and XY mixers and a relaxation of the Grover mixer: Given a basis of any subspace, a resource efficient mixer can be constructed that preserves the subspace. The numerical examples provided show a dramatic reduction of CX gates when compared to previous results. We call our approach logical X-Mixer or logical X QAOA (), since it can be understood as dividing the subspace into code spaces of stabilizers S and consecutively applying logical rotational X gates associated with these code spaces. Overall, we hope that this new perspective can lead to further insight into the development of quantum algorithms.- 25 November 2024
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 8, 1535
Open AccessLX-mixers for QAOA: Optimal mixers restricted to subspaces and the stabilizer formalism
We present a novel formalism to both understand and construct mixers that preserve a given subspace. The method connects and utilizes the stabilizer formalism that is used in error correcting codes. This can be useful in the setting when the quantum approximate optimization algorithm (QAOA), a popular meta-heuristic for solving combinatorial optimization problems, is applied in the setting where the constraints of the problem lead to a feasible subspace that is large but easy to specify. The proposed method gives a systematic way to construct mixers that are resource efficient in the number of controlled not gates and can be understood as a generalization of the well-known X and XY mixers and a relaxation of the Grover mixer: Given a basis of any subspace, a resource efficient mixer can be constructed that preserves the subspace. The numerical examples provided show a dramatic reduction of CX gates when compared to previous results. We call our approach logical X-Mixer or logical X QAOA (), since it can be understood as dividing the subspace into code spaces of stabilizers S and consecutively applying logical rotational X gates associated with these code spaces. Overall, we hope that this new perspective can lead to further insight into the development of quantum algorithms. - Open Access
- 10 June 2022
- Published by MDPI AG in Algorithms
- Vol. 15 (6) , 202
Constraint Preserving Mixers for the Quantum Approximate Optimization Algorithm
The quantum approximate optimization algorithm/quantum alternating operator ansatz (QAOA) is a heuristic to find approximate solutions of combinatorial optimization problems. Most of the literature is limited to quadratic problems without constraints. However, many practically relevant optimization problems do have (hard) constraints that need to be fulfilled. In this article, we present a framework for constructing mixing operators that restrict the evolution to a subspace of the full Hilbert space given by these constraints. We generalize the “XY”-mixer designed to preserve the subspace of “one-hot” states to the general case of subspaces given by a number of computational basis states. We expose the underlying mathematical structure which reveals more of how mixers work and how one can minimize their cost in terms of the number of CX gates, particularly when Trotterization is taken into account. Our analysis also leads to valid Trotterizations for an “XY”-mixer with fewer CX gates than is known to date. In view of practical implementations, we also describe algorithms for efficient decomposition into basis gates. Several examples of more general cases are presented and analyzed.
- 10 June 2022
- Published by MDPI AG in Algorithms
- Vol. 15 (6) , 202
Open AccessConstraint Preserving Mixers for the Quantum Approximate Optimization Algorithm
The quantum approximate optimization algorithm/quantum alternating operator ansatz (QAOA) is a heuristic to find approximate solutions of combinatorial optimization problems. Most of the literature is limited to quadratic problems without constraints. However, many practically relevant optimization problems do have (hard) constraints that need to be fulfilled. In this article, we present a framework for constructing mixing operators that restrict the evolution to a subspace of the full Hilbert space given by these constraints. We generalize the “XY”-mixer designed to preserve the subspace of “one-hot” states to the general case of subspaces given by a number of computational basis states. We expose the underlying mathematical structure which reveals more of how mixers work and how one can minimize their cost in terms of the number of CX gates, particularly when Trotterization is taken into account. Our analysis also leads to valid Trotterizations for an “XY”-mixer with fewer CX gates than is known to date. In view of practical implementations, we also describe algorithms for efficient decomposition into basis gates. Several examples of more general cases are presented and analyzed.
- Open Access
- 6 April 2022
- Published by Wurttembergische Landesbibliothek in Zeitschrift Fur Wurttembergische Landesgeschichte
- Vol. 72, 540-543
Rezension von: Fuchs, Franz u.a. (Hrsg.), König, Fürsten und Reich im 15. Jahrhundert
König, Fürsten und Reich im 15. Jahrhundert, hg. von Franz Fuchs, Paul-Joachim Heinig und Jörg Schwarz (Forschungen zur Kaiser- und Papstgeschichte des Mittelalters, Beihefte zu J. F. Böhmer, Regesta Imperii, Band 29). Köln, Weimar, Wien: Böhlau Verlag 2009. VIII und 396 S. ISBN 978-3-412-20473-0. € 49,90
- 6 April 2022
- Published by Wurttembergische Landesbibliothek in Zeitschrift Fur Wurttembergische Landesgeschichte
- Vol. 72, 540-543
Open AccessRezension von: Fuchs, Franz u.a. (Hrsg.), König, Fürsten und Reich im 15. Jahrhundert
König, Fürsten und Reich im 15. Jahrhundert, hg. von Franz Fuchs, Paul-Joachim Heinig und Jörg Schwarz (Forschungen zur Kaiser- und Papstgeschichte des Mittelalters, Beihefte zu J. F. Böhmer, Regesta Imperii, Band 29). Köln, Weimar, Wien: Böhlau Verlag 2009. VIII und 396 S. ISBN 978-3-412-20473-0. € 49,90
- Open Access
- 24 March 2022
- Published by Wurttembergische Landesbibliothek in Zeitschrift Fur Wurttembergische Landesgeschichte
- Vol. 74, 522-523
Rezension von: Gonzaga, Barbara, Die Briefe (1455–1508)
Barbara Gonzaga: Die Briefe / Le Lettere (1455–1508), bearb. von / a cura di Christina Antenhofer, Axel Behne, Daniela Ferrari, Jürgen Herold und Peter Rückert, Übersetzung von / traduzione di Valentina Nucera, Stuttgart: Kohlhammer 2013. 492 S. mit 51 Abb. ISBN 978-3-17-023381-2. Geb. € 49,–
- 24 March 2022
- Published by Wurttembergische Landesbibliothek in Zeitschrift Fur Wurttembergische Landesgeschichte
- Vol. 74, 522-523
Open AccessRezension von: Gonzaga, Barbara, Die Briefe (1455–1508)
Barbara Gonzaga: Die Briefe / Le Lettere (1455–1508), bearb. von / a cura di Christina Antenhofer, Axel Behne, Daniela Ferrari, Jürgen Herold und Peter Rückert, Übersetzung von / traduzione di Valentina Nucera, Stuttgart: Kohlhammer 2013. 492 S. mit 51 Abb. ISBN 978-3-17-023381-2. Geb. € 49,–
- Open Access
- 24 March 2022
- Published by Wurttembergische Landesbibliothek in Zeitschrift Fur Wurttembergische Landesgeschichte
- Vol. 74, 525-526
Rezension von: Fuchs, Franz; Wagner, Ulrich (Hrsg.), Würzburger Ratsprotokolle 1432–1454
Würzburger Ratsprotokolle 1432–1454, hg. von Franz Fuchs und Ulrich Wagner, bearb. von Antonia Bieber unter Mitwirkung von Anna Maria Fersch und Katharina Räth (Fontes Herbipolenses, Editionen und Studien aus dem Stadtarchiv Würzburg, Bd. 9), Würzburg: Ferdinand Schöningh 2014. 543 S. mit 13 farb. Abb. und 1 Karte. ISBN 978-3-87717-715-0. € 49,–
- 24 March 2022
- Published by Wurttembergische Landesbibliothek in Zeitschrift Fur Wurttembergische Landesgeschichte
- Vol. 74, 525-526
Open AccessRezension von: Fuchs, Franz; Wagner, Ulrich (Hrsg.), Würzburger Ratsprotokolle 1432–1454
Würzburger Ratsprotokolle 1432–1454, hg. von Franz Fuchs und Ulrich Wagner, bearb. von Antonia Bieber unter Mitwirkung von Anna Maria Fersch und Katharina Räth (Fontes Herbipolenses, Editionen und Studien aus dem Stadtarchiv Würzburg, Bd. 9), Würzburg: Ferdinand Schöningh 2014. 543 S. mit 13 farb. Abb. und 1 Karte. ISBN 978-3-87717-715-0. € 49,–
- Open Access
- 13 February 2021
- Published by Springer Nature in SN Computer Science
- Vol. 2 (2) , 1-14
Efficient Encoding of the Weighted MAX $k$-CUT on a Quantum Computer Using QAOAThe weighted MAX $$k$$ -CUT problem consists of finding ak-partition of a given weighted undirected graphG(V, E), such that the sum of the weights of the crossing edges is maximized. The problem is of particular interest as it has a multitude of practical applications. We present a formulation of the weighted MAX $$k$$ -CUT suitable for running the quantum approximate optimization algorithm (QAOA) on noisy intermediate scale quantum (NISQ) devices to get approximate solutions. The new formulation uses a binary encoding that requires only $$|V|\log _2k$$ qubits. The contributions of this paper are as follows: (i) a novel decomposition of the phase-separation operator based on the binary encoding into basis gates is provided for the MAX $$k$$ -CUT problem for $$k>2$$ . (ii) Numerical simulations on a suite of test cases comparing different encodings are performed. (iii) An analysis of the resources (number of qubits, CX gates) of the different encodings is presented. (iv) Formulations and simulations are extended to the case of weighted graphs. For smallkand with further improvements whenkis not a power of two, our algorithm is a possible candidate to show quantum advantage on NISQ devices.- 13 February 2021
- Published by Springer Nature in SN Computer Science
- Vol. 2 (2) , 1-14
Open AccessEfficient Encoding of the Weighted MAX $k$-CUT on a Quantum Computer Using QAOAThe weighted MAX $$k$$ -CUT problem consists of finding ak-partition of a given weighted undirected graphG(V, E), such that the sum of the weights of the crossing edges is maximized. The problem is of particular interest as it has a multitude of practical applications. We present a formulation of the weighted MAX $$k$$ -CUT suitable for running the quantum approximate optimization algorithm (QAOA) on noisy intermediate scale quantum (NISQ) devices to get approximate solutions. The new formulation uses a binary encoding that requires only $$|V|\log _2k$$ qubits. The contributions of this paper are as follows: (i) a novel decomposition of the phase-separation operator based on the binary encoding into basis gates is provided for the MAX $$k$$ -CUT problem for $$k>2$$ . (ii) Numerical simulations on a suite of test cases comparing different encodings are performed. (iii) An analysis of the resources (number of qubits, CX gates) of the different encodings is presented. (iv) Formulations and simulations are extended to the case of weighted graphs. For smallkand with further improvements whenkis not a power of two, our algorithm is a possible candidate to show quantum advantage on NISQ devices. - 1 November 2017
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 121, 38-51
Uncertainty quantification for linear hyperbolic equations with stochastic process or random field coefficients
- 1 November 2017
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 121, 38-51
Uncertainty quantification for linear hyperbolic equations with stochastic process or random field coefficients
- Open Access
- 30 September 2016
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 753 (3) , 032063
Analyzing complex wake-terrain interactions and its implications on wind-farm performance.
- 30 September 2016
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 753 (3) , 032063
Open AccessAnalyzing complex wake-terrain interactions and its implications on wind-farm performance.
- Open Access
- 29 September 2016
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 753 (8) , 082031
Wake modeling in complex terrain using a hybrid Eulerian-Lagrangian Split Solver
Wake vortices (WVs) generated by aircraft are a source of risk to the following aircraft. The probability of WV related accidents increases in the vicinity of airport runways due to the shorter time of recovery after a WV encounter. Hence, solutions that can reduce the risk of WV encounters are needed to ensure increased flight safety. In this work we propose an interesting approach to model such wake vortices in real time using a hybrid Eulerian- Lagrangian approach. We derive an appropriate mathematical model, and show a comparison of the different types of solvers. We will conclude with a real life application of the methodology by simulating how wake vortices left behind by an aircraft at the Vffirnes airport in Norway get transported and decay under the influence of a background wind and turbulence field. Although the work demonstrates the application in an aviation context the same approach can be used in a wind energy context.
- 29 September 2016
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 753 (8) , 082031
Open AccessWake modeling in complex terrain using a hybrid Eulerian-Lagrangian Split Solver
Wake vortices (WVs) generated by aircraft are a source of risk to the following aircraft. The probability of WV related accidents increases in the vicinity of airport runways due to the shorter time of recovery after a WV encounter. Hence, solutions that can reduce the risk of WV encounters are needed to ensure increased flight safety. In this work we propose an interesting approach to model such wake vortices in real time using a hybrid Eulerian- Lagrangian approach. We derive an appropriate mathematical model, and show a comparison of the different types of solvers. We will conclude with a real life application of the methodology by simulating how wake vortices left behind by an aircraft at the Vffirnes airport in Norway get transported and decay under the influence of a background wind and turbulence field. Although the work demonstrates the application in an aviation context the same approach can be used in a wind energy context.