The global transverse-field Ising model with non-monotonic time-dependent transverse field is polynomially equivalent to the gate model of quantum computation.
and Nocera, Alberto and Rams, Marek M
8 Pith papers cite this work, alongside 100 external citations. Polarity classification is still indexing.
8
Pith papers citing it
100
external citations · OpenAlex
citation-role summary
background 3
citation-polarity summary
years
2026 8verdicts
UNVERDICTED 8roles
background 3polarities
background 3representative citing papers
Simulations show tr-QGS detects 0.7 eV electronic coherence lasting >50 fs and electronic-to-vibrational coherence transfer at 200 fs in PBI-1 trimers, features hidden in conventional fluorescence measurements.
AQUIRE is the first error-aware adaptive Bayesian protocol for simultaneously estimating the mean and error of observables on qudit quantum computers using generalized Pauli operators and overlap grouping.
Introduces a toolbox for studying energy gaps, eigenstate structure, and optimization dynamics in quantum annealing formulations of database problems.
Classical kernelisation fully reduces many small and sparse unit-disk graphs for MIS and MWIS native to Rydberg arrays, but dense graphs retain finite irreducible kernels, with vertex weights increasing reducibility and extended interaction ranges suppressing it.
PEPSKit.jl is a Julia package that supplies high-level algorithms for ground-state, time-evolution and finite-temperature iPEPS simulations with symmetry support on various lattices.
Most institutions should start with the smallest quantum capability layer that delivers repeatable near-term value and builds expertise rather than acquiring large on-premises systems.
Quantum annealing is described as a heuristic for discrete optimization and sampling that also serves as a platform for studying non-equilibrium many-body quantum dynamics with programmable spin systems.
citing papers explorer
-
Polynomial equivalence of the global transverse-field Ising model and the gate model of quantum computation
The global transverse-field Ising model with non-monotonic time-dependent transverse field is polynomially equivalent to the gate model of quantum computation.
-
Quantum Ghost Spectroscopy Reveals Hidden Electronic Coherence in Molecular Aggregates
Simulations show tr-QGS detects 0.7 eV electronic coherence lasting >50 fs and electronic-to-vibrational coherence transfer at 200 fs in PBI-1 trimers, features hidden in conventional fluorescence measurements.
-
An Error-aware and Adaptive Method for the Estimation of Quantum Observables on Qudit-Based Quantum Computers
AQUIRE is the first error-aware adaptive Bayesian protocol for simultaneously estimating the mean and error of observables on qudit quantum computers using generalized Pauli operators and overlap grouping.
-
A Toolbox to Understand the Physics of Quantum Data Management
Introduces a toolbox for studying energy gaps, eigenstate structure, and optimization dynamics in quantum annealing formulations of database problems.
-
Reducibility of native weighted graphs on Rydberg Arrays
Classical kernelisation fully reduces many small and sparse unit-disk graphs for MIS and MWIS native to Rydberg arrays, but dense graphs retain finite irreducible kernels, with vertex weights increasing reducibility and extended interaction ranges suppressing it.
-
PEPSKit.jl: A Julia package for projected entangled-pair state simulations
PEPSKit.jl is a Julia package that supplies high-level algorithms for ground-state, time-evolution and finite-temperature iPEPS simulations with symmetry support on various lattices.
-
What quantum computer to buy?
Most institutions should start with the smallest quantum capability layer that delivers repeatable near-term value and builds expertise rather than acquiring large on-premises systems.
-
Quantum Annealing: Optimisation, Sampling, and Many-Body Dynamics
Quantum annealing is described as a heuristic for discrete optimization and sampling that also serves as a platform for studying non-equilibrium many-body quantum dynamics with programmable spin systems.