Marek M. Rams
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
Research Interests
Marek M. Rams has a total of 197 co-authors. Here are the top co-authors by number of shared publications:
- Christian Näther
Institut für Anorganische Chemie, Universität Kiel, Germany
16 shared publications - Michael Zwolak
Biophysical and Biomedical Measurement Group Microsystems and Nanotechnology Division Physical Measurement Laboratory National Institute of Standards and Technology 20899 Gaithersburg Maryland USA
16 shared publications Jacek Dziarmaga
Institute of Theoretical Physics, Faculty of Physics, Astronomy and Applied Computer Science, Jagiellonian University, ul. Łojasiewicza 11, 30-348 Kraków, Poland
15 shared publications- Gabriela Wójtowicz
University of Ulm
10 shared publications - Aritra Sinha
Max Planck Institute for the Physics of Complex Systems
9 shared publications - Winfried Plass
Institut für Anorganische und Analytische Chemie Friedrich‐Schiller‐Universität Jena Jena Germany
9 shared publications
Latest Publications
- Open Access
- 15 April 2026
- Published by Royal Society of Chemistry (RSC) in Dalton Transactions
- Vol. 55 (17) , 6954-6964
Disentangling anisotropy and exchange in Co(NCX) 2 (X = S, Se) chains via THz-EPR spectroscopy
Chalcogen substitution in Co(NCX) 2 (py) 2 (X = S, Se) chains modulates magnetic anisotropy while leaving exchange interactions largely unchanged, revealed by THz-EPR spectroscopy, calorimetry, and ab initio calculations.
- 15 April 2026
- Published by Royal Society of Chemistry (RSC) in Dalton Transactions
- Vol. 55 (17) , 6954-6964
Open AccessDisentangling anisotropy and exchange in Co(NCX) 2 (X = S, Se) chains via THz-EPR spectroscopy
Chalcogen substitution in Co(NCX) 2 (py) 2 (X = S, Se) chains modulates magnetic anisotropy while leaving exchange interactions largely unchanged, revealed by THz-EPR spectroscopy, calorimetry, and ab initio calculations.
- Open Access
- 7 April 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (2)
Evaluating the limits of Quantum Approximate Optimization Algorithm parameter transfer at high rounds on sparse Ising models with geometrically local cubic terms
The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters, which is usually done using a variational optimization loop. Parameter transfer, or parameter concentration, is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable nonvariational learning method for QAOA angle finding. In this work, we systematically study QAOA parameter transferability from small problem sizes (16 and 27 decision variables) onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models with geometrically local higher-order terms using the Julia based QAOA simulation tool to perform classical angle finding for up to 49 QAOA layers ( p ) . Parameter transfer of the fixed angles is validated using a combination of full state vector, projected entangled pair states, matrix product state, and LOWESA numerical simulations. We find that the QAOA parameter transfer from single instances applied to other (unseen) problem instances does not in general provide monotonically improving performance as a function of p —there are many cases where the performance temporarily decreases as a function of p —but despite this the transferred angles have a general trend of improved expectation value as the QAOA depth increases, in many cases converging close to the true ground-state energy of the 100 + qubit instances. We also sample the hardware-compatible Ising models using the ensemble of transfer-learned QAOA parameters on several superconducting qubit IBM quantum processors with 127, 133, and 156 qubits. We find continuous solution quality improvement of the hardware-compatible QAOA circuits run on the IBM noisy intermediate-scale quantum processors up to p = 5 on , up to p = 9 on , and up to p = 10 on .
- 7 April 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (2)
Open AccessEvaluating the limits of Quantum Approximate Optimization Algorithm parameter transfer at high rounds on sparse Ising models with geometrically local cubic terms
The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters, which is usually done using a variational optimization loop. Parameter transfer, or parameter concentration, is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable nonvariational learning method for QAOA angle finding. In this work, we systematically study QAOA parameter transferability from small problem sizes (16 and 27 decision variables) onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models with geometrically local higher-order terms using the Julia based QAOA simulation tool to perform classical angle finding for up to 49 QAOA layers ( p ) . Parameter transfer of the fixed angles is validated using a combination of full state vector, projected entangled pair states, matrix product state, and LOWESA numerical simulations. We find that the QAOA parameter transfer from single instances applied to other (unseen) problem instances does not in general provide monotonically improving performance as a function of p —there are many cases where the performance temporarily decreases as a function of p —but despite this the transferred angles have a general trend of improved expectation value as the QAOA depth increases, in many cases converging close to the true ground-state energy of the 100 + qubit instances. We also sample the hardware-compatible Ising models using the ensemble of transfer-learned QAOA parameters on several superconducting qubit IBM quantum processors with 127, 133, and 156 qubits. We find continuous solution quality improvement of the hardware-compatible QAOA circuits run on the IBM noisy intermediate-scale quantum processors up to p = 5 on , up to p = 9 on , and up to p = 10 on .
- 18 March 2026
- Published by Royal Society of Chemistry (RSC) in Physical Chemistry Chemical Physics
- Vol. 28 (11) , 6974-6982
Tuning of the spin reorientation and spin switching in Sm-doped NdFeO 3
In Nd 1− x Sm x FeO 3 , Sm substitution shifts the Fe-sublattice spin-reorientation window to a higher temperature; in Nd 0.5 Sm 0.5 FeO 3 , a weak −20 Oe negative-field-cooling bias moves the spin-switching temperature by ∼158 K (175–333 K) at H = 20 Oe.
- 18 March 2026
- Published by Royal Society of Chemistry (RSC) in Physical Chemistry Chemical Physics
- Vol. 28 (11) , 6974-6982
Tuning of the spin reorientation and spin switching in Sm-doped NdFeO 3
In Nd 1− x Sm x FeO 3 , Sm substitution shifts the Fe-sublattice spin-reorientation window to a higher temperature; in Nd 0.5 Sm 0.5 FeO 3 , a weak −20 Oe negative-field-cooling bias moves the spin-switching temperature by ∼158 K (175–333 K) at H = 20 Oe.
- Open Access
- 9 February 2026
- Published by American Physical Society (APS) in Physical Review B
- Vol. 113 (8)
Finite temperature dopant-induced spin reorganization explored via tensor networks in the two-dimensional t − J model
We study the two-dimensional t − J model at finite temperature directly in the thermodynamic limit using purification represented by an infinite projected entangled-pair state (iPEPS). We reach temperatures down to T / t = 0.1 and hole concentrations up to 1 − n ≃ 0.25 , and provide benchmark thermodynamic-limit results for the specific heat, uniform susceptibility, and charge compressibility. We identify a susceptibility maximum T * that tracks the buildup of short-range antiferromagnetism and a shallow compressibility enhancement upon cooling in the same doping window. To expose the underlying microscopic mechanism, we introduce dopant-conditioned multipoint correlators that quantify how holes reorganize nearby exchange: Single holes weaken adjacent antiferromagnetic bonds, while nearest-neighbor hole pairs produce a cooperative response that reinforces antiferromagnetism on the parallel plaquette edge. Over the same parameter window, d -wave pairing correlations remain short-ranged. These results provide experiment-compatible thermodynamic-limit benchmarks and establish dopant-conditioned correlators as incisive probes of finite-temperature spin-texture reorganization in doped Mott insulators.
- 9 February 2026
- Published by American Physical Society (APS) in Physical Review B
- Vol. 113 (8)
Open AccessFinite temperature dopant-induced spin reorganization explored via tensor networks in the two-dimensional t − J model
We study the two-dimensional t − J model at finite temperature directly in the thermodynamic limit using purification represented by an infinite projected entangled-pair state (iPEPS). We reach temperatures down to T / t = 0.1 and hole concentrations up to 1 − n ≃ 0.25 , and provide benchmark thermodynamic-limit results for the specific heat, uniform susceptibility, and charge compressibility. We identify a susceptibility maximum T * that tracks the buildup of short-range antiferromagnetism and a shallow compressibility enhancement upon cooling in the same doping window. To expose the underlying microscopic mechanism, we introduce dopant-conditioned multipoint correlators that quantify how holes reorganize nearby exchange: Single holes weaken adjacent antiferromagnetic bonds, while nearest-neighbor hole pairs produce a cooperative response that reinforces antiferromagnetism on the parallel plaquette edge. Over the same parameter window, d -wave pairing correlations remain short-ranged. These results provide experiment-compatible thermodynamic-limit benchmarks and establish dopant-conditioned correlators as incisive probes of finite-temperature spin-texture reorganization in doped Mott insulators.
- Open Access
- 26 November 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (5)
Quantum Fisher information from tensor-network integration of the Lyapunov equation
The quantum Fisher information (QFI) is a geometric measure of state deformation calculated along the trajectory parametrizing an ensemble of quantum states. It serves as a key concept in quantum metrology, where it is linked to the fundamental limit on the precision of the parameter that we estimate. However, the QFI is notoriously difficult to calculate due to its nonlinear mathematical form. For mixed states, standard numerical procedures based on eigendecomposition quickly become impractical with increasing system size. To overcome this limitation, we introduce a numerical approach based on Lyapunov integrals that combines the concept of symmetric logarithmic derivative and tensor networks. Importantly, this approach requires only the elementary matrix product states algorithm for time evolution, opening a perspective for broad usage and application to many-body systems. We discuss the advantages and limitations of our methodology through an illustrative example in quantum metrology, where the thermal state of the transverse-field Ising model is used to measure magnetic field amplitude.
- 26 November 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (5)
Open AccessQuantum Fisher information from tensor-network integration of the Lyapunov equation
The quantum Fisher information (QFI) is a geometric measure of state deformation calculated along the trajectory parametrizing an ensemble of quantum states. It serves as a key concept in quantum metrology, where it is linked to the fundamental limit on the precision of the parameter that we estimate. However, the QFI is notoriously difficult to calculate due to its nonlinear mathematical form. For mixed states, standard numerical procedures based on eigendecomposition quickly become impractical with increasing system size. To overcome this limitation, we introduce a numerical approach based on Lyapunov integrals that combines the concept of symmetric logarithmic derivative and tensor networks. Importantly, this approach requires only the elementary matrix product states algorithm for time evolution, opening a perspective for broad usage and application to many-body systems. We discuss the advantages and limitations of our methodology through an illustrative example in quantum metrology, where the thermal state of the transverse-field Ising model is used to measure magnetic field amplitude.
- Open Access
- 20 November 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (21) , 211903
Emergent Nonthermal Fluid from Jets in the Massive Schwinger Model Using Tensor Networks
We analyze the correlation between the energy, momentum, and spatial entanglement produced by two luminal jets in the massive Schwinger model. Using tensor network methods, we show that for m / g > 1 / π , in the vicinity of the strong- to weak-coupling transition, a nearly perfect and chargeless effective fluid behavior appears around the midrapidity region with a universal energy-pressure relationship. The evolution of energy and pressure is strongly correlated with the rise of the spatial entanglement entropy, indicating a key role of quantum dynamics. Some of these observations may be used to analyze high multiplicity jet fragmentation events, energy-energy and energy-charge correlators at current collider energies.
- 20 November 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (21) , 211903
Open AccessEmergent Nonthermal Fluid from Jets in the Massive Schwinger Model Using Tensor Networks
We analyze the correlation between the energy, momentum, and spatial entanglement produced by two luminal jets in the massive Schwinger model. Using tensor network methods, we show that for m / g > 1 / π , in the vicinity of the strong- to weak-coupling transition, a nearly perfect and chargeless effective fluid behavior appears around the midrapidity region with a universal energy-pressure relationship. The evolution of energy and pressure is strongly correlated with the rise of the spatial entanglement entropy, indicating a key role of quantum dynamics. Some of these observations may be used to analyze high multiplicity jet fragmentation events, energy-energy and energy-charge correlators at current collider energies.
- Open Access
- 16 October 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-10
Pushing the boundary of quantum advantage in hard combinatorial optimization with probabilistic computers
Recent demonstrations on specialized benchmarks have reignited excitement for quantum computers, yet their advantage for real-world problems remains an open question. Here, we show that probabilistic computers, co-designed with hardware to implement Monte Carlo algorithms, provide a scalable classical pathway for solving hard optimization problems. We focus on two algorithms applied to three-dimensional spin glasses: discrete-time simulated quantum annealing and adaptive parallel tempering. We benchmark these methods against a leading quantum annealer. For simulated quantum annealing, increasing replicas improves residual energy scaling, consistent with extreme value theory. Adaptive parallel tempering, supported by non-local isoenergetic cluster moves, scales more favorably and outperforms simulated quantum annealing. Field Programmable Gate Arrays or specialized chips can implement these algorithms in modern hardware, leveraging massive parallelism to accelerate them while improving energy efficiency. Our results establish a rigorous classical baseline for assessing practical quantum advantage and present probabilistic computers as a scalable platform for real-world optimization challenges.
- 16 October 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-10
Open AccessPushing the boundary of quantum advantage in hard combinatorial optimization with probabilistic computers
Recent demonstrations on specialized benchmarks have reignited excitement for quantum computers, yet their advantage for real-world problems remains an open question. Here, we show that probabilistic computers, co-designed with hardware to implement Monte Carlo algorithms, provide a scalable classical pathway for solving hard optimization problems. We focus on two algorithms applied to three-dimensional spin glasses: discrete-time simulated quantum annealing and adaptive parallel tempering. We benchmark these methods against a leading quantum annealer. For simulated quantum annealing, increasing replicas improves residual energy scaling, consistent with extreme value theory. Adaptive parallel tempering, supported by non-local isoenergetic cluster moves, scales more favorably and outperforms simulated quantum annealing. Field Programmable Gate Arrays or specialized chips can implement these algorithms in modern hardware, leveraging massive parallelism to accelerate them while improving energy efficiency. Our results establish a rigorous classical baseline for assessing practical quantum advantage and present probabilistic computers as a scalable platform for real-world optimization challenges.
- Open Access
Approaching the scaling limit of transport through lattices with dephasing
We examine the stationary--state equations for lattices with generalized Markovian dephasing and relaxation. When the Hamiltonian is quadratic, the single--particle correlation matrix has a closed system of equations even in the presence of these two processes. The resulting equations have a vectorized form related to, but distinct from, Lyapunov's equation. We present an efficient solution that helps to achieve the scaling limit, e.g., of the current decay with lattice length. As an example, we study the super--diffusive--to--diffusive transition in a lattice with long--range hopping and dephasing. The approach enables calculations with up to $10^4$ sites, representing an increase of $10$ to $40$ times over prior studies. This enables a more precise extraction of the diffusion exponent, enhances agreement with theoretical results, and supports the presence of a phase transition. There is a wide range of problems that have Markovian relaxation, noise, and driving. They include quantum networks for machine--learning--based classification and extended reservoir approaches (ERAs) for transport. The results here will be useful for these classes of problems.Open AccessApproaching the scaling limit of transport through lattices with dephasing
We examine the stationary--state equations for lattices with generalized Markovian dephasing and relaxation. When the Hamiltonian is quadratic, the single--particle correlation matrix has a closed system of equations even in the presence of these two processes. The resulting equations have a vectorized form related to, but distinct from, Lyapunov's equation. We present an efficient solution that helps to achieve the scaling limit, e.g., of the current decay with lattice length. As an example, we study the super--diffusive--to--diffusive transition in a lattice with long--range hopping and dephasing. The approach enables calculations with up to $10^4$ sites, representing an increase of $10$ to $40$ times over prior studies. This enables a more precise extraction of the diffusion exponent, enhances agreement with theoretical results, and supports the presence of a phase transition. There is a wide range of problems that have Markovian relaxation, noise, and driving. They include quantum networks for machine--learning--based classification and extended reservoir approaches (ERAs) for transport. The results here will be useful for these classes of problems. - 15 September 2025
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 163 (11)
Approaching the scaling limit of transport through lattices with dephasing
We examine the stationary-state equations for lattices with generalized Markovian dephasing and relaxation. When the Hamiltonian is quadratic, the single-particle correlation matrix has a closed system of equations even in the presence of these two processes. The resulting equations have a vectorized form related to, but distinct from, Lyapunov’s equation. We present an efficient solution that helps to achieve the scaling limit, e.g., of the current decay with lattice length. As an example, we study the super-diffusive-to-diffusive transition in a lattice with long-range hopping and dephasing. The approach enables calculations with up to 104 sites, representing an increase of 10 to 40 times over prior studies. This enables a more precise extraction of the diffusion exponent, enhances agreement with theoretical results, and supports the presence of a phase transition. There is a wide range of problems that have Markovian relaxation, noise, and driving. They include quantum networks for machine-learning-based classification and extended reservoir approaches for transport. The results here will be useful for these classes of problems.
- 15 September 2025
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 163 (11)
Approaching the scaling limit of transport through lattices with dephasing
We examine the stationary-state equations for lattices with generalized Markovian dephasing and relaxation. When the Hamiltonian is quadratic, the single-particle correlation matrix has a closed system of equations even in the presence of these two processes. The resulting equations have a vectorized form related to, but distinct from, Lyapunov’s equation. We present an efficient solution that helps to achieve the scaling limit, e.g., of the current decay with lattice length. As an example, we study the super-diffusive-to-diffusive transition in a lattice with long-range hopping and dephasing. The approach enables calculations with up to 104 sites, representing an increase of 10 to 40 times over prior studies. This enables a more precise extraction of the diffusion exponent, enhances agreement with theoretical results, and supports the presence of a phase transition. There is a wide range of problems that have Markovian relaxation, noise, and driving. They include quantum networks for machine-learning-based classification and extended reservoir approaches for transport. The results here will be useful for these classes of problems.