Franz Georg Fuchs

• Fuchs, Franz Georg; Bassa, Ruben Pariente & Lien, Frida (2025). Encodings of the weighted MAX k-CUT problem on qubit systems. Frontiers in Quantum Science and Technology. 4. doi: 10.3389/frqst.2025.1636042. Full text in Research Archive Show summary

  The weighted MAX k-CUT problem involves partitioning a weighted undirected graph into k subsets, or colors, to maximize the sum of the weights of edges between vertices in different subsets. This problem has significant applications across multiple domains. This paper explores encoding methods for MAX k-CUT on qubit systems, utilizing quantum approximate optimization algorithms (QAOA) and addressing the challenge of encoding integer values on quantum devices with binary variables. We examine various encoding schemes and evaluate the efficiency of these approaches. The paper presents a systematic and resource efficient method to implement phase separation operator for the cost function of the MAX k-CUT problem. When encoding the problem into the full Hilbert space, we show the importance of encoding the colors in a balanced way. We also explore the option to encode the problem into a suitable subspace, by designing suitable state preparations and constrained mixers (LX-and Grover-mixer). Numerical simulations on weighted and unweighted graph instances demonstrate the effectiveness of these encoding schemes, particularly in optimizing circuit depth, approximation ratios, and computational efficiency.

• Kulseng, Ola Tangen; Miao, Stanley; Fuchs, Franz Georg & Stasik, Alexander Johannes (2025). QuantumReservoirPy: A Software Package for Time Series Prediction. Journal of Open Source Software (JOSS). 10(110). doi: 10.21105/joss.07994. Full text in Research Archive Show summary

  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.

• Fuchs, Franz Georg & Bassa, Ruben Pariente (2024). LX-mixers for QAOA: Optimal mixers restricted to subspaces and the stabilizer formalism. Quantum. 8. doi: 10.22331/q-2024-11-25-1535. Full text in Research Archive Show summary

  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 (LX-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.

• Fuchs, Franz Georg; Lye, Kjetil Olsen; Nilsen, Halvor Møll; Stasik, Alexander Johannes & Sartor, Giorgio (2022). Constraint Preserving Mixers for the Quantum Approximate Optimization Algorithm. Algorithms. 15(6). doi: 10.3390/a15060202. Full text in Research Archive Show summary

  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.

• Fuchs, Franz Georg; Kolden, Herman Øie; Aase, Niels Henrik & Sartor, Giorgio (2021). Efficient Encoding of the Weighted MAX k-CUT on a Quantum Computer Using QAOA. SN Computer Science. ISSN 2662-995X. 2(2). doi: 10.1007/s42979-020-00437-z. Full text in Research Archive Show summary

  The weighted MAX k-CUT problem consists of finding a k-partition of a given weighted undirected graph G(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|log2k 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 small k and with further improvements when k is not a power of two, our algorithm is a possible candidate to show quantum advantage on NISQ devices.

• Fuchs, Franz Georg; Falch, Vemund & Johnsen, Christian Svingen (2020). Quantum Poker - a game for quantum computers suitable for benchmarking error mitigation techniques on NISQ devices. The European Physical Journal Plus. 135. doi: 10.1140/epjp/s13360-020-00360-5. Full text in Research Archive Show summary

  Quantum computers are on the verge of becoming a commercially available reality. They represent a paradigm shift in computing, with a steep learning gradient. The creation of games is a way to ease the transition for beginners. We present a game similar to the Poker variant Texas hold ’em with the intention to serve as an engaging pedagogical tool to learn the basics rules of quantum computing. The concepts of quantum states, quantum operations and measurement can be learned in a playful manner. The difference to the classical variant is that the community cards are replaced by a quantum register that is “randomly” initialized, and the cards for each player are replaced by quantum gates, randomly drawn from a set of available gates. Each player can create a quantum circuit with their cards, with the aim to maximize the number of 1’s that are measured in the computational basis. The basic concepts of superposition, entanglement and quantum gates are employed. We provide a proof-of-concept implementation using Qiskit (Aleksandrowicz et al. in An open-source framework for quantum computing, 2019). A comparison of the results for the created circuits using a simulator and IBM machines is conducted, showing that error rates on contemporary quantum computers are still very high. For the success of noisy intermediate scale quantum (NISQ) computers, improvements on the error rates and error mitigation techniques are necessary, even for simple circuits. We show that quantum error mitigation (QEM) techniques can be used to improve expectation values of observables on real quantum devices.

• Barth, Andrea & Fuchs, Franz Georg (2017). Uncertainty quantification for linear hyperbolic equations with stochastic process or random field coefficients. Applied Numerical Mathematics. ISSN 0168-9274. 121, p. 38–51. doi: 10.1016/j.apnum.2017.06.009. Full text in Research Archive Show summary

  In this paper hyperbolic partial differential equations with random coefficients are discussed. Such random partial differential equations appear for instance in traffic flow problems as well as in many physical processes in random media. Two types of models are presented: The first has a time-dependent coefficient modeled by the Ornstein–Uhlenbeck process. The second has a random field coefficient with a given covariance in space. For the former a formula for the exact solution in terms of moments is derived. In both cases stable numerical schemes are introduced to solve these random partial differential equations. Simulation results including convergence studies conclude the theoretical findings.

• Tabib, Mandar; Rasheed, Adil & Fuchs, Franz Georg (2017). Analysis of Unsteady Hydrodynamics Related to Vortex Induced Vibrations on Bluff-Bodied Offshore Structure, ASME 2017 36th International Conference on Ocean, Offshore and Arctic Engineering - Volume 2: Prof. Carl Martin Larsen and Dr. Owen Oakley Honoring Symposia on CFD and VIV. The American Society of Mechanical Engineers (ASME). ISSN 9780791857649. doi: 10.1115/OMAE2017-61207. Full text in Research Archive Show summary

  Flows around a fixed cylinder with uniform and pulsating inflow conditions at different Reynolds numbers are simulated using Large Eddy Simulation (LES). For pulsating inflow, a sinusoidal profile, with an amplitude ΔU and a pulsation frequency fe, is superimposed onto the mean velocity U∞ at the inlet plane. The current study reveals that the pulsation can influence flow-physics in three possible ways as compared to uniform inflow conditions: (a) The vortex shedding pattern is seen to be more asymmetric for pulsating inflow than for uniform inflow. This needs to be validated with an experimental campaign devoted to the study of flow-asymmetricity due to pulsatile and uniform flow condition. (b) The dominant shedding frequency fd gets locked with respect to the frequency of the pulsating inflow fe, (for both the turbulent and transition regime) at a ratio of fe/fs0 equivalent to 0.65 – 0.75 (where fs0 is the vortex shedding frequency for uniform inflow) and ε = ΔU / (2πfeD) ≈ 0.2, where D is the diameter of the cylinder. This numerical observation is validated using the experimentally observed turbulent vortex regime work ( [1])in this range. For conditions with fe/fs0 > 0.75 the lock-in may happen at fe/2. (c) Compared to uniform inflow, the pulsating inflow leads to a larger drag coefficient. The drag coefficient is influenced by the ratios fe/fs0 and ΔU / U∞.

• Fuchs, Franz Georg & Hjelmervik, Jon M. (2016). Interactive Isogeometric Volume Visualization with Pixel-Accurate Geometry. IEEE Transactions on Visualization and Computer Graphics (TVCG). ISSN 1077-2626. 22(2), p. 1102–1114. doi: 10.1109/TVCG.2015.2430337. Full text in Research Archive Show summary

  A recent development, called isogeometric analysis, provides a unified approach for design, analysis and optimization of functional products in industry. Traditional volume rendering methods for inspecting the results from the numerical simulations cannot be applied directly to isogeometric models. We present a novel approach for interactive visualization of isogeometric analysis results, ensuring correct, i.e., pixel-accurate geometry of the volume including its bounding surfaces. The entire OpenGL pipeline is used in a multi-stage algorithm leveraging techniques from surface rendering, order-independent transparency, as well as theory and numerical methods for ordinary differential equations. We showcase the efficiency of our approach on different models relevant to industry, ranging from quality inspection of the parametrization of the geometry, to stress analysis in linear elasticity, to visualization of computational fluid dynamics results.

• Fuchs, Franz Georg; Rasheed, Adil; Tabib, Mandar & Fonn, Eivind (2016). Wake modeling in complex terrain using a hybrid Eulerian-Lagrangian Split Solver. Journal of Physics: Conference Series (JPCS). ISSN 1742-6588. 753(8). doi: 10.1088/1742-6596/753/8/082031. Full text in Research Archive Show summary

  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 Værnes 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.

• Tabib, Mandar; Rasheed, Adil & Fuchs, Franz Georg (2016). Analyzing complex wake-terrain interactions and its implications on wind-farm performance. Journal of Physics: Conference Series (JPCS). ISSN 1742-6588. 753(3). doi: 10.1088/1742-6596/753/3/032063. Full text in Research Archive Show summary

  Rotating wind turbine blades generate complex wakes involving vortices (helical tip-vortex, root-vortex etc.).These wakes are regions of high velocity deficits and high turbulence intensities and they tend to degrade the performance of down-stream turbines. Hence, a conservative inter-turbine distance of up-to 10 times turbine diameter (10D) is sometimes used in wind-farm layout (particularly in cases of flat terrain). This ensures that wake-effects will not reduce the overall wind-farm performance, but this leads to larger land footprint for establishing a wind-farm. In-case of complex-terrain, within a short distance (say 10D) itself, the nearby terrain can rise in altitude and be high enough to influence the wake dynamics. This wake-terrain interaction can happen either (a) indirectly, through an interaction of wake (both near tip vortex and far wake large-scale vortex) with terrain induced turbulence (especially, smaller eddies generated by small ridges within the terrain) or (b) directly, by obstructing the wake-region partially or fully in its flow-path. Hence, enhanced understanding of wake- development due to wake-terrain interaction will help in wind farm design. To this end the current study involves: (1) understanding the numerics for successful simulation of vortices, (2) understanding fundamental vortex-terrain interaction mechanism through studies devoted to interaction of a single vortex with different terrains, (3) relating influence of vortex-terrain interactions to performance of a wind-farm by studying a multi-turbine wind-farm layout under different terrains. The results on interaction of terrain and vortex has shown a much faster decay of vortex for complex terrain compared to a flatter-terrain. The potential reasons identified explaining the observation are (a) formation of secondary vortices in flow and its interaction with the primary vortex and (b) enhanced vorticity diffusion due to increased terrain-induced turbulence. The implications of this vortex-terrain interactions on wind-farm performance is observed by comparing two LES simulations of a multi-turbine wind-farm layout (in real actual complex terrain and a made-up flat terrain scenario) with the observed annual power data at the actual wind-farm. The comparison reveals drop in power production due to terrain and wake effects for flatter terrain case. The insights from this study can serve as a step towards enhancing wake-dissipation through either artificial obstruction or artificial terrain modifications.

• Barth, Andrea & Fuchs, Franz Georg (2016). Uncertainty quantification for hyperbolic conservation laws with flux coefficients given by spatiotemporal random fields. SIAM Journal on Scientific Computing. ISSN 1064-8275. 38(4), p. A2209–A2231. doi: 10.1137/15M1027723. Full text in Research Archive Show summary

  In this paper hyperbolic partial differential equations (PDEs) with random coefficients are discussed. We consider the challenging problem of flux functions with coefficients modeled by spatiotemporal random fields. Those fields are given by correlated Gaussian random fields in space and Ornstein--Uhlenbeck processes in time. The resulting system of equations consists of a stochastic differential equation for each random parameter coupled to the hyperbolic conservation law. We define an appropriate solution concept in this setting and analyze errors and convergence of discretization methods. A novel discretization framework, based on Monte Carlo finite volume methods, is presented for the robust computation of moments of solutions to those random hyperbolic PDEs. We showcase the approach on two examples which appear in applications---the magnetic induction equation and linear acoustics---both with a spatiotemporal random background velocity field.

• Hjelmervik, Jon M. & Fuchs, Franz Georg (2015). Interactive Pixel-Accurate Rendering of LR-Splines and T-Splines. Eurographics State of the Art Reports. ISSN 1017-4656. p. 65–68. doi: 10.2312/egsh.20151016. Full text in Research Archive Show summary

  Flexible surface types on irregular grids, such as T-splines and LR-splines, are gaining popularity in science and industry due to the possibility for local grid refinement. We present a novel rendering algorithm for those surface types that guarantees pixel-accurate geometry and water-tight tessellation (no drop-outs). Before rendering, we extract the Bézier coefficients. The resulting irregular grids of Bézier patches are then rendered using a multistage algorithm, that decouples the tesselator and the patch geometry. The implementation using OpenGL utilizes compute shaders and hardware tessellation functionality. We showcase interactive rendering achieved by our approach on three representative use cases.

• Fuchs, Franz Georg; McMurry, Andrew David; Risebro, Nils Henrik & Mishra, Siddhartha (2014). Explicit and implicit finite volume schemes for radiation MHD and the effects of radiation on wave propagation in stratified atmospheres. In Ancona, Fabio; Bressan, Alberto; Marcati, Pierangelo & Marson, Andrea (Ed.), Hyperbolic Problems: Theory, Numerics, Applications. Proceedings of the Fourteenth International Conference on Hyperbolic Problems held in Padova, June 25-29, 2012. American Institute of Mathematical Sciences (AIMS) Press. ISSN 9781601330178. p. 41–59. Full text in Research Archive Show summary

  We present a radiation MHD model based on moments (M1) of the radiative transport equation. This M1 model is approximated numerically by robust finite volume schemes. We compare explicit and semi-implicit schemes and show how radiation affects wave propagation in stratified atmospheres.

View all works in NVA

• Fuchs, Franz Georg (2026). Kvantedatamaskiner og kryptografi - En trussel mot sikkerhet? Hva med nettbanken? doi: https:/www.tekna.no/kursarkiv/53000/seniorteknologene-kvantedatamaskiner-og-kryptografi-53324/. Full text in Research Archive
• Fuchs, Franz Georg (2026). Panel discussion: Quantum Mathematics, Algorithms and Software. doi: https:/iqtevent.com/nordics. Full text in Research Archive
• Fuchs, Franz Georg (2026). Centre for Quantum Computing and Applications (QSTAR). doi: https:/iqtevent.com/nordics/. Full text in Research Archive
• Luteberget, Bjørnar Steinnes; Pettersen, Kjell Fredrik; Sartor, Giorgio; Fuchs, Franz Georg; Seidel, Tobias & leib, dominik [Show all 7 contributors for this article] (2026). An exact branch and bound algorithm for the generalized qubit mapping problem. doi: https:/sites.google.com/view/neqst-qc4ds-workshop-2026/home. Full text in Research Archive Show summary

  Quantum circuits are typically represented by a (ordered) sequence of gates over a set of virtual qubits. During compilation, the virtual qubits of the gates are assigned to the physical qubits of the underlying quantum hardware. To ensure that the resulting circuit respects hardware connectivity constraints, additional SWAP gates are inserted as needed. Together, this is called the Qubit Mapping Problem (QMP), which is known to be NP-hard. A very common way to deal with the complexity of the QMP is to partition the sequence of gates into a sequence of gate groups (or layers). However, this imposes a couple of important restrictions: (1) SWAP gates can only be added between pairs of consecutive groups, and (2) all the gates belonging to a certain group have to be executed (in parallel) in the same time slot. The first one prevents gates to be re-arranged optimally, while the second one imposes a time discretization that practically ignores gate execution time. Here we present a flexible branch and bound algorithm for a generalized version of the QMP that either considers or ignores the gate layering and the gate execution time. The algorithm can find proven optimal solutions for all variations of the QMP, but also offers a great platform for different heuristic algorithms. We present results on several benchmark sets of small quantum circuits, and we show how ignoring the layering can significantly improve some key performance indicators of the compiled circuit.

• Stasik, Alexander Johannes & Fuchs, Franz Georg (2026). Quantum random walks for decision making and optimization. doi: https:/sites.google.com/view/neqst-qc4ds-workshop-2026/home. Full text in Research Archive Show summary

  Random walks provide a natural framework for modeling sequential discrete decision processes. Their quantum counterparts have been proposed as potential tools for addressing such problems, particularly if suitable oracles can be constructed to encode general loss functions over decision sequences. In this talk, we discuss perspectives on how quantum random walks could be applied to decision-making and optimization problems, and outline challenges and opportunities in oracle design.

• Pariente, Ruben; Fuchs, Franz Georg & Quinton, Finley Alexander (2026). A quantum greedy algorithm for the minimum vertex cover. doi: https:/sites.google.com/view/neqst-qc4ds-workshop-2026/home. Full text in Research Archive Show summary

  The Minimum Vertex Cover (MVC) problem, a fundamental NP-hard combinatorial optimization task, seeks the smallest set of vertices in a graph such that every edge is incident to at least one selected vertex. I introduce a quantum greedy algorithm for MVC that combines a constraint-preserving quantum ansatz with a classical sequential variable-fixing strategy. Using a single-layer multi-controlled rotation circuit, the quantum state encodes an unbalanced superposition over all feasible covers, enabling greedy selection toward minimal solutions. This hybrid approach preserves feasibility by construction, explores the solution space efficiently, and retains higher-dimensional superpositions throughout the optimization, offering a scalable alternative to penalty-based QAOA for constrained combinatorial optimization on near-term quantum hardware.

• Fuchs, Franz Georg & Pariente, Ruben (2026). Constraint-Preserving Quantum Optimization: Mixers, Encodings, and Efficient Circuits". doi: https:/sites.google.com/view/neqst-qc4ds-workshop-2026/program. Full text in Research Archive Show summary

  Constraint-preserving quantum optimization offers a principled alternative to penalty-based methods by restricting quantum evolution to the feasible subspace of an optimization problem. In this work, we unify and extend recent advances in constrained quantum algorithms by jointly addressing three core components: mixer Hamiltonians, problem encodings, and circuit-level implementations. We develop a general framework for constructing mixers that guarantee feasibility throughout the evolution, including stabilizer-based and projector-defined constructions that apply to a wide range of combinatorial and physical constraints. We analyze encoding strategies for discrete optimization problems, with particular emphasis on non-power-of-two variable domains, and show how subspace encodings and balanced full-space encodings impact both optimization landscapes and hardware resources. Finally, we present compact circuit constructions for implementing constrained evolutions, enabling efficient realization of mixers and excitation operators with reduced entangling-gate and fault-tolerant overhead. Together, these results clarify the trade-offs between expressivity, resource efficiency, and algorithmic performance in constraint-preserving quantum optimization, and provide practical guidelines for designing scalable quantum optimization algorithms on near-term and fault-tolerant quantum hardware.

• Martres, Delphine; Fuchs, Franz Georg & Pariente, Ruben (2026). Performance of random reservoir unitaries for quantum extreme learning machines using a fault-tolerant construction. Full text in Research Archive Show summary

  Quantum extreme learning machines (QELM) is a framework for quantum machine learning which aims to leverage the high dimensionality of the Hilbert space of a quantum reservoir to construct a rich feature map of classical data inputs. There are promising results mostly obtained on ideal simulators, but it is known that the inherent noise in quantum devices makes the state quickly converge to a specific mixed state independent of the input, making the QELM input-agnostic and thus useless[1]. As a step towards practical application of QELM before fully fault-tolerant hardware is realized, we propose an analysis of the performance of random reservoir unitaries with a controlled T count, which can be easily constructed fault-tolerantly for CSS codes, compared to the widely used chaotic Ising model reservoir in terms of Fourier richness of the outputs, and study their impact on the state convergence phenomenon when implemented fault-tolerantly for a small system.

• Fuchs, Franz Georg & Aakre, Gina (2025). To nye kvantesentre til UiO og SINTEF. [Internet]. Univ. i Oslo nett. doi: https:/www.titan.uio.no/teknologi/2025/to-nye-kvantesentre-til-uio-og-sintef-.html. Full text in Research Archive Show summary

  I dag lanserte regjeringen fire nye forskningssentre på kvanteteknologi. UiO, SINTEF og Simula får til sammen 244 millioner kroner.

• Fuchs, Franz Georg (2025). Researchers Solve Qubit Mapping Problem by Partitioning Gate Sequences into Consecutive Groups. [Internet]. Quantumzeitgeist.com. doi: https:/quantumzeitgeist.com/solve-qubit-mapping-problem-partitioning-gate-sequences-consecutive/. Full text in Research Archive
• Pariente, Ruben & Fuchs, Franz Georg (2025). Quantum Reservoir Computing Lecture. Full text in Research Archive
• Pariente, Ruben & Fuchs, Franz Georg (2025). Introduction to Variational Quantum Algorithms: QAOA. Full text in Research Archive
• Fuchs, Franz Georg (2025). Hva er kvanteberegning? doi: https:/dnva.no/detskjer/2025/09/kvantemekanikken-100-ar-fra-usikkerhetsrelasjonen-til-hoyteknologi. Full text in Research Archive
• Fuchs, Franz Georg; Gilje, Sanne; Syverud-Lindland, Dina & Moberg, Jan Magnus (2025). Podcast Teknisk sett: "Bruker KI for å lage kode til kvantemaskiner". [Internet]. Podkast Teknisk Sett. Full text in Research Archive
• Tywoniuk, Konrad; Hansen, Jan Petter; Greve, Martin Møller; Fuchs, Franz Georg; Førre, Morten & Hjorth-Jensen, Morten [Show all 9 contributors for this article] (2025). 2025: Kvantefysikkens år. [Internet]. https://www.khrono.no/2025-kvantefysikkens-ar/963076. Full text in Research Archive Show summary

  Det knyttes for tiden store forventninger til nye kvanteteknologiske gjennombrudd. I år setter FN spesielt søkelys på kvantefysikkens revolusjonerende bidrag. Men hva er denne mystiske vitenskapen?

• Fuchs, Franz Georg (2025). Kvanteklokka tikker! Hvordan norsk næringsliv kan gjøre seg kvanteklar. Full text in Research Archive
• Fuchs, Franz Georg & Bassa, Ruben Pariente (2025). Efficient Circuit Construction of Constrained Quantum Evolutions of Sparse Operators. Full text in Research Archive
• Fuchs, Franz Georg & Bassa, Ruben Pariente (2025). Realizing subspace-controlled Pauli operators. Full text in Research Archive
• Fuchs, Franz Georg & Bassa, Ruben Pariente (2024). Logical X Operations for Constrained Problems. Full text in Research Archive
• Fuchs, Franz Georg; Lenssen, Jerome; Martres, Delphine & Myneni, Hemanadhan (2024). Quantum Error correction - theory and hands-on. Full text in Research Archive
• Fuchs, Franz Georg & Bassa, Ruben Pariente (2024). Efficient Realizations of Certain Sparse Unitaries. Full text in Research Archive
• Fuchs, Franz Georg (2024). Introduction to Tensor Networks. Full text in Research Archive Show summary

  Tensor networks (TN) have important applications in mathematics, chemistry, physics, and machine learning. They can for instance be used to describe quantum many-body systems, simulate quantum circuits, or compress neural networks. In this talk I will give a gentle introduction to the mathematical framework of TNs. After introducing the basic concepts and notation, I well go through some well-known algorithms/methods for sampling, calculating inner products, and time evolution.

• Fuchs, Franz Georg (2024). Norsk kvanteteknologi-samarbeid forlenges med fire år. [Internet]. MedWatch. Full text in Research Archive
• Fuchs, Franz Georg (2024). Fornyet satsing på kvanteteknologi (pressemelding). [Internet]. NTB Info. Full text in Research Archive Show summary

  Pressemelding

• Fuchs, Franz Georg (2024). Norsk satsing får fire nye år. [Internet]. Elektronikknett. Full text in Research Archive
• Fuchs, Franz Georg (2024). Kvantedatamaskiner og kryptografi. Full text in Research Archive Show summary

  Hvilke betingelser må være oppfylt for at en kvantedatamaskin skal kunne bryte RSA-krypteringen? Implementeringen av feilkorrigering for kvantedatamaskiner medfører betydelige ressurskrav. Hva kreves for å konstruere en "tilstrekkelig stor" kvantedatamaskin, og når kan man forvente at dette vil være mulig? https://nsm.no/kurs-og-konferanser/sikkerhetskonferansen/sikkerhetskonferansen-2024/program/kvantedatamaskiner-og-kryptografi

• Fuchs, Franz Georg (2024). Kvantedatamaskiner som regneressurs og mulige anvendelser. Full text in Research Archive
• Larsen, Nadia S. & Fuchs, Franz Georg (2024). Quantum information and computing within mathematics departments at UiO and SINTEF: current perspectives. Full text in Research Archive
• Fuchs, Franz Georg (2024). Khrono debatt: Ingen kvantesprang uten problemer å løse. [Internet]. Khrono. Full text in Research Archive Show summary

  https://www.khrono.no/ingen-kvantesprang-uten-problemer-a-lose/912158

• Fuchs, Franz Georg (2024). Kvanteteknologi: Det neste store etter KI? Full text in Research Archive Show summary

  En vanlig misforståelse er at kvantedatamaskiner vil bli superraske erstatninger for dagens maskiner. Faktisk er kvantedatamaskiner tregere på grunnleggende operasjoner, men de tilbyr radikalt nye måter å løse spesifikke problemer på. Hvordan sikrer vi at Norge har kunnskapen vi trenger for å ta i bruk kvanteteknologien når den er moden?

• Bassa, Ruben Pariente & Fuchs, Franz Georg (2023). Hands-On experiments with quantum gates and quantum circuits: QAOA for MaxCut. Full text in Research Archive
• Bassa, Ruben Pariente & Fuchs, Franz Georg (2023). Exploring the Quantum Landscape in Norway and Advancements in Quantum Approximate Optimization Algorithm. Full text in Research Archive
• Fuchs, Franz Georg (2023). Introduction to use cases for optimisation: QAOA. Full text in Research Archive
• Stasik, Alexander Johannes & Fuchs, Franz Georg (2023). QUantum reservoir computing. Full text in Research Archive
• Fuchs, Franz Georg & Sævold, Heidi (2023). Kvantedatamaskin tilgjengelig for europeiske selskaper. [Internet]. digi.no. Full text in Research Archive
• Fuchs, Franz Georg (2023). Kvantedatamaskiner - Hva er det og hva kan de brukes til? Full text in Research Archive
• Fuchs, Franz Georg (2023). Quantum Computing: Separating Hype from Realistic Expectations. Full text in Research Archive
• Fuchs, Franz Georg (2023). Hamiltonians with time evolution restricted to subspaces. Full text in Research Archive
• Fuchs, Franz Georg (2023). Optimal mixers restricted to subspaces and the stabilizer formalism. Full text in Research Archive
• Fuchs, Franz Georg & Ola, Tangen Kulseng (2023). Her tester de løsninger for fremtidens kvantedatamaskiner. [Internet]. https://www.digi.no/. Full text in Research Archive
• Fuchs, Franz Georg (2023). Avtale på plass: Norske forskere får bruke europeisk kvantedatamaskin. [Internet]. https://www.digi.no/. Full text in Research Archive
• Fuchs, Franz Georg (2022). Hands-on: Qiskit applied to use cases for optimisation. Full text in Research Archive
• Fuchs, Franz Georg & Persson, Aksel Faanes (2022). Podcast Smart forklart. 50. Quantum computing: Fremtidens superraske datamaskiner. [Internet]. https://www.sintef.no/smart-forklart/. Full text in Research Archive Show summary

  https://play.acast.com/s/60b75c5b8c26f80013d5ebce/630faf7543400800124d24b4

• Fuchs, Franz Georg (2022). Optimisation and variational methods: QAOA/QUBO, VQE, and more. Full text in Research Archive
• Fuchs, Franz Georg (2022). Quantum computing as enabling technology for Norway. Full text in Research Archive Show summary

  https://www.tekna.no/kursarkiv/kvanterevulosjonen-rykker-narmere-44012/ https://www.tekna.no/fag-og-nettverk/IKT/ikt-bloggen/Kvanterevolusjonen/

• Fuchs, Franz Georg (2022). Constrained mixers for the quantum approximate optimization algorithm (QAOA). Full text in Research Archive
• Fuchs, Franz Georg (2022). An introduction to quantum error mitigation. Full text in Research Archive Show summary

  Quantum error mitigation (QEM) aims to reduce the errors that occur on quantum chips when a quantum algorithm is executed. In this talk I will give an introduction to two popular methods for QEM. The first one is based on extrapolation techniques, and the second on quasiprobabilistic decompositions. I will also highlight differences and similarities of QEM and quantum error correction.

• Gjøsteen, Kristian; Fuchs, Franz Georg & Engesvik, Sara (2022). Kvantedatamaskiners destruktive potensiale: – Vi må forsikre oss mot at verden ramler sammen. [Internet]. https://www.digi.no/artikler/kvantedatamaskiners-destruktive. Full text in Research Archive
• Fuchs, Franz Georg & Olsen, Jan Willie (2022). Skal kartlegge kvanteteknologi i Norge. [Internet]. https://khrono.no/skal-kartlegge-kvanteteknologi-i-norge/707. Full text in Research Archive
• Fuchs, Franz Georg (2022). Quantum Computing and the Gemini Center. Full text in Research Archive
• Fuchs, Franz Georg (2022). Variational quantum algorithms: Challenges and Opportunities. Full text in Research Archive
• Fuchs, Franz Georg (2022). Kvantedatamaskiner – er vi nær et paradigmeskifte? Full text in Research Archive
• Fuchs, Franz Georg (2022). Why we need research on quantum computing in Norway. Full text in Research Archive
• Fuchs, Franz Georg (2022). Quantum Optimization for Research and Business. Full text in Research Archive
• Fuchs, Franz Georg (2021). The disruptive power of quantum computers: Hype or reality? Full text in Research Archive Show summary

  Opening keynote: Our modern society relies heavily on the ever-increasing processing power of digital computers for all kinds of applications. But there are important problems that businesses and society face that will remain intractable even for the best supercomputers we can hope to build. Quantum computers, a new computing paradigm, have the potential to help solve some of the most pressing problems humanity is facing. In this talk I will separate the hype from the reality.

• Fuchs, Franz Georg (2021). NISQ devices: Error mitigation techniques and combinatorial optimization problems. Full text in Research Archive
• Fuchs, Franz Georg & Leine, Jan Erlend (2021). Kvantemaskinen - den nye teknospranget. [Radio]. https://radio.nrk.no/serie/ekko/sesong/202102/MDFP02002821. Full text in Research Archive Show summary

  Det er et kvantesprang på gang i verden, med datatmaskiner som må regne mye raskere enn i dag. Men er Norge på banen?

• Fuchs, Franz Georg (2021). The disruptive power of​ quantum computers: Hype or reality? Full text in Research Archive
• Fuchs, Franz Georg (2021). Using quantum computers to solve combinatorial optimization problems. Full text in Research Archive
• Fuchs, Franz Georg (2021). NTNU: First Norwegian centre for quantum technology is being rolled out. [Internet]. Sciencebusiness.net. Full text in Research Archive Show summary

  Også publisert her: Norwegianscitechnews.com, Telecomrevy.no, Elektronikknett.no

• Fuchs, Franz Georg (2021). Kvanteteknologi skal gjøre Norge klar for ny datarevolusjon. [Internet]. Elmagasinet.no. Full text in Research Archive
• Fuchs, Franz Georg (2021). Kvanteteknologi skal gjøre Norge klar for ny datarevolusjon. [Internet]. NTB kommunikasjon. Full text in Research Archive
• Fuchs, Franz Georg & Øyvann, Stig (2021). Vil bringe Norge inn i kvante-alderen. [Internet]. https://www.cw.no/artikkel/forskning/vil-bringe-norge-inn-kv. Full text in Research Archive
• Fuchs, Franz Georg & Røise, Martin Braathen (2021). Spår trøbbel for norsk næringsliv hvis vi ikke kjapt får kompetanse på denne teknologien. [Internet]. https://www.digi.no/. Full text in Research Archive
• Fuchs, Franz Georg (2020). Quantum Computing: An introduction. Full text in Research Archive
• Fuchs, Franz Georg (2020). Error mitigation and the weighted MAX k-CUT on NISQ devices. Full text in Research Archive
• Fuchs, Franz Georg (2020). When will I get a quantum computer and what can I do with it? Full text in Research Archive
• Fuchs, Franz Georg (2019). Quantum Advantage in the NISQ computing era. Full text in Research Archive
• Caroline, Enge; Fuchs, Franz Georg; Vemund, Falch & Christian, Johnsen (2019). Norske studenter lager spill til «den neste store teknologien»: Kvantedatamaskinen. [Journal]. Aftenposten. Full text in Research Archive
• Fuchs, Franz Georg (2019). Quantum Computing and Quantum Supremacy. Full text in Research Archive
• Fuchs, Franz Georg (2019). The second quantum revolution. Full text in Research Archive
• Fuchs, Franz Georg (2019). Quantum Computing and Optimization. Full text in Research Archive
• Fuchs, Franz Georg (2019). Quantum computing - possibilities and limitations. Full text in Research Archive
• Fuchs, Franz Georg (2019). QUANTUM COMPUTING IN THE NISQ ERA - QUANTUM POKER AND ERROR MITIGATION​. Full text in Research Archive
• Fuchs, Franz Georg (2019). What is a quantum computer? Full text in Research Archive
• Gjeset, Schjølberg Ulla & Fuchs, Franz Georg (2019). Google hevder deres kvantedatamaskin kan løse oppgave som er umulig for vanlige datamaskiner. [Internet]. forskning.no. Full text in Research Archive
• Fuchs, Franz Georg; Nilsen, Halvor Møll; Sartor, Giorgio; Remonato, Filippo & Schittny, Robert (2019). The landscape of quantum algorithms. Full text in Research Archive
• Fuchs, Franz Georg (2017). Interactive and Pixel-Accurate Rendering of Locally Refined (LR-)Splines and Isogeometric Volumes. Full text in Research Archive
• Fuchs, Franz Georg; Rasheed, Adil; Tabib, Mandar & Fonn, Eivind (2016). Wake modeling in complex terrain using a hybrid Eulerian-Lagrangian Split Solver. Full text in Research Archive
• Hjelmervik, Jon M. & Fuchs, Franz Georg (2016). Direct Interactive Visualization of LR- and T-Spline Volumes for Use in Large-Scale Scientific Computing and Isogeometric Analysis. Full text in Research Archive
• Hjelmervik, Jon M.; Fuchs, Franz Georg; Dyken, Erik Christopher & Bjønnes, Erik W (2014). Real-Time Isogeometric Volume Visualization. Full text in Research Archive
• Fuchs, Franz Georg & Hjelmervik, Jon M. (2014). Interactive Direct Visualization of Isogeometric CFD Results. Full text in Research Archive
• Fuchs, Franz Georg; Hjelmervik, Jon M.; Dyken, Erik Christopher & Bjønnes, Erik W (2013). Real-Time Pixel-Accurate Isogeometric Volume Visualization. Full text in Research Archive
• Hjelmervik, Jon M.; Bjønnes, Erik W; Dyken, Erik Christopher & Fuchs, Franz Georg (2013). Fast Volumetric Visualization of Isogeometric Models. Full text in Research Archive Show summary

  Learn how to achieve real-time, pixel-accurate volume visualization of volumetric splines objects using OpenGL 4.3. See unprecedented fast ray-casting through volumetric spline models where both the geometric shape and attached simulation results are represented as volumetric splines. The presented rendering method consists of two passes; the first pass use tessellator and atomic counters to find all ray-surface intersection points, while a second compute pass performs the ray traversal. Simulations using volumetric spline models are called isogeometric analysis, because they allow the same representation to be shared throughout the modeling and simulation stages. We provide fast, reliable visualization, achieving the ultimate goal in isogeometric analysis.

• Tabib, Mandar; Fuchs, Franz Georg & Rasheed, Adil (2016). Report on wake vortex micro-scale turbulent airflow interaction methodologies. SESAR 12.2.2 Report. Full text in Research Archive
• Rasheed, Adil; Tabib, Mandar & Fuchs, Franz Georg (2016). Wake Vortex Micro-Scale Turbulence Prototype Development and Sensitivity Studies. SESAR 12.2.2. Full text in Research Archive

View all works in NVA