Tameem Albash
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
Tameem Albash has a total of 94 co-authors. Here are the top co-authors by number of shared publications:
Albuquerque Sandia National Laboratories (Snl-Nm)
8 shared publicationsUsdoe National Nuclear Security Administration (Nnsa)
8 shared publications- Itay Hen
University of Southern California
6 shared publications - Noah Tobias Jacobson
Sandia National Laboratories
5 shared publications - Clifford V. Johnson
University of California, Santa Barbara
4 shared publications Conor Smith
University of New Mexico
4 shared publications
Latest Publications
- 25 June 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (1)
Trajectory-independent speed limits for controlled open quantum systems
- 25 June 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (1)
Trajectory-independent speed limits for controlled open quantum systems
- Open Access
- 15 June 2026
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 10
Temporal Coarse Graining for Classical Stochastic Noise in Quantum Systems
Simulations of quantum systems with Hamiltonian classical stochastic noise can be challenging when the noise exhibits temporal correlations over a multitude of time scales, such as for 1 / f noise in solid-state quantum information processors. Here we present an approach for simulating Hamiltonian classical stochastic noise that performs temporal coarse-graining by effectively integrating out the high-frequency components of the noise. We focus on the case where the stochastic noise can be expressed as a sum of Ornstein-Uhlenbeck processes. Temporal coarse-graining is then achieved by conditioning the stochastic process on a coarse realization of the noise, expressing the conditioned stochastic process in terms of a sum of smooth, deterministic functions and bridge processes with boundaries fixed at zero, and performing the ensemble average over the bridge processes. For Ornstein-Uhlenbeck processes, the deterministic components capture all dependence on the coarse realization, and the stochastic bridge processes are not only independent but taken from the same distribution with correlators that can be expressed analytically, allowing the associated noise propagators to be precomputed once for all simulations. This combination of noise trajectories on a coarse time grid and ensemble averaging over bridge processes has practical advantages, such as a simple concatenation rule, that we highlight with numerical examples.
- 15 June 2026
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 10
Open AccessTemporal Coarse Graining for Classical Stochastic Noise in Quantum Systems
Simulations of quantum systems with Hamiltonian classical stochastic noise can be challenging when the noise exhibits temporal correlations over a multitude of time scales, such as for 1 / f noise in solid-state quantum information processors. Here we present an approach for simulating Hamiltonian classical stochastic noise that performs temporal coarse-graining by effectively integrating out the high-frequency components of the noise. We focus on the case where the stochastic noise can be expressed as a sum of Ornstein-Uhlenbeck processes. Temporal coarse-graining is then achieved by conditioning the stochastic process on a coarse realization of the noise, expressing the conditioned stochastic process in terms of a sum of smooth, deterministic functions and bridge processes with boundaries fixed at zero, and performing the ensemble average over the bridge processes. For Ornstein-Uhlenbeck processes, the deterministic components capture all dependence on the coarse realization, and the stochastic bridge processes are not only independent but taken from the same distribution with correlators that can be expressed analytically, allowing the associated noise propagators to be precomputed once for all simulations. This combination of noise trajectories on a coarse time grid and ensemble averaging over bridge processes has practical advantages, such as a simple concatenation rule, that we highlight with numerical examples.
- Open Access
- 1 October 2025
- Published by Office of Scientific and Technical Information (OSTI)
TEMPORAL COARSE GRAINING FOR CLASSICAL STOCHASTIC NOISE IN QUANTUM SYSTEMS
- 1 October 2025
- Published by Office of Scientific and Technical Information (OSTI)
Open AccessTEMPORAL COARSE GRAINING FOR CLASSICAL STOCHASTIC NOISE IN QUANTUM SYSTEMS
- Open Access
- 4 June 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (6)
Cost of emulating a small quantum annealing problem in the circuit model
Demonstrations of quantum advantage for certain sampling problems have generated considerable excitement for quantum computing and have further spurred the development of circuit-model quantum computers, which represent quantum programs as a sequence of quantum gates acting on a finite number of qubits. Amongst this excitement, analog quantum computation has become less prominent, with the expectation that circuit-model quantum computers will eventually be sufficient for emulating analog quantum computation and thus rendering analog quantum computation obsolete. In this work we explore the basic requirements for emulating a specific analog quantum computation in the circuit model: the preparation of a biased superposition of degenerate ground states of an Ising Hamiltonian using an adiabatic evolution. We show that the overhead of emulation is substantial even for this simple problem. This supports using analog quantum computation for solving time-dependent Hamiltonian dynamics in the short term and midterm, assuming analog errors can be made low enough and coherence times long enough to solve problems of practical interest.
- 4 June 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (6)
Open AccessCost of emulating a small quantum annealing problem in the circuit model
Demonstrations of quantum advantage for certain sampling problems have generated considerable excitement for quantum computing and have further spurred the development of circuit-model quantum computers, which represent quantum programs as a sequence of quantum gates acting on a finite number of qubits. Amongst this excitement, analog quantum computation has become less prominent, with the expectation that circuit-model quantum computers will eventually be sufficient for emulating analog quantum computation and thus rendering analog quantum computation obsolete. In this work we explore the basic requirements for emulating a specific analog quantum computation in the circuit model: the preparation of a biased superposition of degenerate ground states of an Ising Hamiltonian using an adiabatic evolution. We show that the overhead of emulation is substantial even for this simple problem. This supports using analog quantum computation for solving time-dependent Hamiltonian dynamics in the short term and midterm, assuming analog errors can be made low enough and coherence times long enough to solve problems of practical interest.
- 22 May 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (5) , 055306
Optimizing temperature distributions for training neural quantum states using parallel tempering
Parametrized artificial neural networks (ANNs) can be very expressive ansatzes for variational algorithms, reaching state-of-the-art energies on many quantum many-body Hamiltonians. Nevertheless, the training of the ANN can be slow and stymied by the presence of local minima in the parameter landscape. One approach to mitigate this issue is to use parallel tempering methods, and in this work, we focus on the role played by the temperature distribution of the parallel tempering replicas. Using an adaptive method that adjusts the temperatures in order to equate the exchange probability between neighboring replicas, we show that this temperature optimization can significantly increase the success rate of the variational algorithm with negligible computational cost by eliminating bottlenecks in the replicas' random walk. We demonstrate this using two different neural networks, a restricted Boltzmann machine and a feedforward network, which we use to study a toy problem based on a permutation invariant Hamiltonian with a pernicious local minimum and the ${J}_{1}\text{\ensuremath{-}}{J}_{2}$ model on a rectangular lattice.- 22 May 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (5) , 055306
Optimizing temperature distributions for training neural quantum states using parallel tempering
Parametrized artificial neural networks (ANNs) can be very expressive ansatzes for variational algorithms, reaching state-of-the-art energies on many quantum many-body Hamiltonians. Nevertheless, the training of the ANN can be slow and stymied by the presence of local minima in the parameter landscape. One approach to mitigate this issue is to use parallel tempering methods, and in this work, we focus on the role played by the temperature distribution of the parallel tempering replicas. Using an adaptive method that adjusts the temperatures in order to equate the exchange probability between neighboring replicas, we show that this temperature optimization can significantly increase the success rate of the variational algorithm with negligible computational cost by eliminating bottlenecks in the replicas' random walk. We demonstrate this using two different neural networks, a restricted Boltzmann machine and a feedforward network, which we use to study a toy problem based on a permutation invariant Hamiltonian with a pernicious local minimum and the ${J}_{1}\text{\ensuremath{-}}{J}_{2}$ model on a rectangular lattice.- 11 March 2025
- Published by American Physical Society (APS) in Physical Review B
- Vol. 111 (11)
Model validation and error attribution for a drifting qubit
- 11 March 2025
- Published by American Physical Society (APS) in Physical Review B
- Vol. 111 (11)
Model validation and error attribution for a drifting qubit
- Open Access
- 1 March 2025
- Published by Office of Scientific and Technical Information (OSTI)
Drifting performance of an exchange-only qubit in Si/SiGe
- 1 March 2025
- Published by Office of Scientific and Technical Information (OSTI)
Open AccessDrifting performance of an exchange-only qubit in Si/SiGe
- Open Access
- 1 March 2025
- Published by Office of Scientific and Technical Information (OSTI)
Temporal Coarse Graining for Classical Stochastic Noise in Quantum Systems
- 1 March 2025
- Published by Office of Scientific and Technical Information (OSTI)
Open AccessTemporal Coarse Graining for Classical Stochastic Noise in Quantum Systems