57,802+ open-access research outputs.
The temperature increase in the contact regions between solids in sliding contact has a huge influence on friction and wear. Here we test an analytical theory for the flash temperature, valid for randโฆ
We derive the first two moments of generic positive stochastic functionals in terms of the one- and two-time probability density functions of the underlying random walk, and we prove ergodicity of obsโฆ
To study generator design for parameterized unitaries in quantum machine learning (QML), we propose an observable-guided generator selection algorithm for $ n $-qubit Pauli-string generator pools. Theโฆ
High-performance computing (HPC) has evolved over decades through multiple architectural transitions, from vector supercomputers to massively parallel CPU clusters and GPU-accelerated systems, continuโฆ
Sgr A* exhibits a persistent negative circular polarization (CP) at 230\,GHz, offering a powerful probe of the magnetic field geometry in its accretion flow. Using a stationary semi-analytic radiativeโฆ
Hybrid variational quantum algorithms are promising for solving practical problems, such as combinatorial optimization, quantum chemistry simulation, quantum machine learning, and quantum error correcโฆ
Stochastic models of diffusion are routinely used to study dispersal of populations, including populations of animals, plants, seeds and cells. Advances in imaging and field measurement technologies mโฆ
As AI systems scale to multi-chiplet and wafer-level architectures, the demand for ultra-high bandwidth and system scalability has outpaced the capabilities of electrical interconnects and computing uโฆ
Identification and characterisation of Kilonovae (KNe) can be instrumental in improving our understanding of cosmology and astrophysics. However, their detection poses unique challenges due to rarity โฆ
We introduce the parity-unfolded architecture, a fault-tolerant quantum computing scheme that relies on direct preparation and teleportation of small-angle rotations $ Z^{1/2^{k}}$ rather than approxiโฆ
Quantum search is among the most important algorithms in quantum computing. At its core is quantum amplitude amplification, a technique that achieves a quadratic speedup over classical search by combiโฆ
We present numerically-informed closed-form expressions for the dominant $(\ell,m)=(2,2)$ waveform harmonic of the post-merger emission from mergers of non-spinning binary black holes with comparable โฆ
Stellar rotation is closely linked to both age and magnetic activity. Through gyrochronology, it provides a means to estimate stellar ages and trace the evolution of planetary systems, and it is also โฆ
We introduce a systematic framework to construct nonlocal observables with extensive quantum Fisher information (QFI) density in stabilizer codes. The construction maps stabilizer generators to dual Iโฆ
We develop a quantum algorithm for estimating the free energy as well as the total Gibbs state of interacting quantum Coulomb gases and molecular systems in dimensions $d \in \{2,3\}$ at finite temperโฆ
Photonic architectures are one of the leading platforms for demonstrating quantum computational advantage, with Boson Sampling and Gaussian Boson Sampling as the primary schemes. Yet, we lack for thesโฆ
The 2-Forrelation problem provides an optimal separation between classical and quantum query complexity and is also the problem used for separating $\mathsf{BQP}$ and $\mathsf{PH}$ relative to an oracโฆ
Binary interactions during the AGB phase can lead to the formation of chemically peculiar stars with overabundances of s-process elements. Only a few hundreds of these stars have been subject to detaiโฆ
The Metropolis-Hastings algorithm is a cornerstone of Markov Chain Monte Carlo methods, underpinning a wide range of applications in computational physics, Bayesian inference, and machine learning. Quโฆ
Toward the large-scale, practical realization of quantum computing, quantum error correction is essential. Among various quantum error-correcting codes, the surface code stands out as a leading candidโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ