Related papers: Flexible and Cost-Effective Spherical to Cartesian…
We present a novel self-correcting, high-speed optoelectronic probabilistic computer architecture that leverages source-device independent (SDI) quantum photonic p-bits integrated with robust electronic control. Our approach combines the…
We discuss in some details a novel algorithm for performing partial-sky spherical harmonic transforms (SHT), building on the Fourier-sphere method of Reinecke et al (2023) handling efficiently high numbers of arbitrary locations on the…
In the calculation of thermodynamic properties and three dimensional structures of macromolecules, such as proteins, it is important to have a good algorithm for computing solvent accessible surface area of macromolecules. Here we propose a…
Quantum error correction is believed to be essential for scalable quantum computation, but its implementation is challenging due to its considerable space-time overhead. Motivated by recent experiments demonstrating efficient manipulation…
A common problem in cosmology is to integrate the product of two or more spherical Bessel functions (sBFs) with different configuration-space arguments against the power spectrum or its square, weighted by powers of wavenumber. Naively…
We propose an efficient reconstruction algorithm named the frozen Gaussian grid-point correction (FGGC) for computing the Schr\"odinger equation in the semi-classical regime using the frozen Gaussian approximation (FGA). The FGA has…
We demonstrate the utility of effective Hamilonians for studying strongly correlated systems, such as quantum spin systems. After defining local relevant degrees of freedom, the numerical Contractor Renormalization (CORE) method is applied…
We study how well topological quantum codes can tolerate coherent noise caused by systematic unitary errors such as unwanted $Z$-rotations. Our main result is an efficient algorithm for simulating quantum error correction protocols based on…
In image compression, classical block-based separable transforms tend to be inefficient when image blocks contain arbitrarily shaped discontinuities. For this reason, transforms incorporating directional information are an appealing…
Thermodynamic computing has emerged as a promising paradigm for accelerating computation by harnessing the thermalization properties of physical systems. This work introduces a novel approach to solving quadratic programming problems using…
Universal quantum computers require fault-tolerant logical qudits, as qudits naturally align with the simulation of multi-level physical systems. Here, we present a general framework and working examples for encoding fault-tolerant logical…
Computational hemodynamics is becoming an increasingly important tool in clinical applications and surgical procedures involving the cardiovascular system. Aim of this review is to provide a compact summary of state of the art 0D-1D…
This study starts from the counter-intuitive question of how we can render a conventional stiff, non-stretchable and even brittle material conformable so that it can fully wrap around a curved surface, such as a sphere, without failure.…
A classical computer does not allow to calculate a discrete cosine transform on N points in less than linear time. This trivial lower bound is no longer valid for a computer that takes advantage of quantum mechanical superposition,…
Recent researches on robotics have shown significant improvement, spanning from algorithms, mechanics to hardware architectures. Robotics, including manipulators, legged robots, drones, and autonomous vehicles, are now widely applied in…
A numerical integration method for guiding-center orbits of charged particles in toroidal fusion devices with three-dimensional field geometry is described. Here, high order interpolation of electromagnetic fields in space is replaced by a…
We outline a strategy to compute deeply inelastic scattering structure functions using a hybrid quantum computer. Our approach takes advantage of the representation of the fermion determinant in the QCD path integral as a quantum mechanical…
I present a new approach for designing quantum error-correcting codes that guarantees a physically natural implementation of Clifford operations. Inspired by the scheme put forward by Gottesman, Kitaev, and Preskill for encoding a qubit in…
Many quantum algorithms make use of oracles which evaluate classical functions on a superposition of inputs. In order to facilitate implementation, testing, and resource estimation of such algorithms, we present quantum circuits for…
One of the major promises of quantum computing is the realization of SIMD (single instruction - multiple data) operations using the phenomenon of superposition. Since the dimension of the state space grows exponentially with the number of…