Related papers: Computing Classical Orbital Elements with Improved…
Simulating curvature due to gravity through warped surfaces is a common visualization aid in Physics education. We reprise a recent experiment exploring orbital trajectories on a precise 3D-printed surface to mimic Newtonian gravity, and…
We investigate a method to compute a finite set of preliminary orbits for solar system bodies using the first integrals of the Kepler problem. This method is thought for the applications to the modern sets of astrometric observations, where…
Quantum algorithms for electronic-structure simulations are actively being developed, yet many hybrid quantum-classical approaches are bottlenecked by the measurement overhead associated with large molecular Hamiltonians. Here we introduce…
The advantages of evolutionary algorithms with respect to traditional methods have been greatly discussed in the literature. While particle swarm optimizers share such advantages, they outperform evolutionary algorithms in that they require…
The partial oracles framework is a quantum search algorithm that has the potential to exceed the quadratic speedup of Grover's algorithm, up to a theoretical maximum of an exponential speedup. Until now, however, the framework has lacked an…
Applying proper orthogonal decomposition to a usual finite element (FE) formulation for space fractional partial differential equation, we get a reduced FE model, which greatly reduces the complexity of computation. Then, the stability…
Here we show how to determine the orbital parameters of a system composed of a star and N companions (that can be planets, brown-dwarfs or other stars), using a simple Fourier analysis of the radial velocity data of the star. This method…
Optimization of low-thrust trajectories that involve a larger number of orbit revolutions is considered a challenging problem. This paper describes a high-precision symplectic method and optimization techniques to solve the minimum-energy…
Hundreds of satellites equipped with cameras orbit the Earth to capture images from locations for various purposes. Since the field of view of the cameras is usually very narrow, the optics have to be adjusted and rotated between single…
In a previous paper, we described a computer program called Qubiter which can decompose an arbitrary unitary matrix into elementary operations of the type used in quantum computation. In this paper, we describe a method of reducing the…
Localization of molecular orbitals finds its importance in the representation of chemical bonding (and anti-bonding) and in the local correlation treatments beyond mean-field approximation. In this paper, we generalize the intrinsic atomic…
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin…
Permutation Entropy and statistiCal Complexity Analysis for astRophYsics (PECCARY) is a computationally inexpensive, statistical method by which any time-series can be characterized as predominantly regular, complex, or stochastic. Elements…
This paper introduces an algorithm to perform optimal reorientation of a spacecraft during a high speed flyby mission that maximizes the time a certain target is kept within the field of view of scientific instruments. The method directly…
Spectral decomposition of linear operators plays a central role in many areas of machine learning and scientific computing. Recent work has explored training neural networks to approximate eigenfunctions of such operators, enabling scalable…
We show that semiclassical formulas such as the Gutzwiller trace formula can be implemented on a quantum computer more efficiently than on a classical device. We give explicit quantum algorithms which yield quantum observables from…
Quantum oracles play key roles in the studies of quantum computation and quantum information. But implementing quantum oracles efficiently with universal quantum gates is a hard work. Motivated by genetic programming, this paper proposes a…
In light of major developments over the past decades in both quantum computing and simulations on classical hardware, it is a serious challenge to identify a real-world problem where quantum advantage is expected to appear. In quantum…
The generalized post-Keplerian parametrization for compact binaries on eccentric bound orbits is established at second post-Newtonian (2PN) order in a class of massless scalar-tensor theories. This result is used to compute the…
A common approach to minimizing the cost of quantum computations is by transforming a quantum system into a basis that can be optimally truncated. Here, we derive classical equations of motion subjected to similar unitary transformations,…