相关论文: Hamiltonian Relaxation
We compare three different models of rotating neutron star spacetimes: the Hartle-Thorne (HT) slow-rotation approximation at second order in rotation, the exact analytic vacuum solution of Manko et al. and a numerical solution of the full…
Numerical relativity is the most promising tool for theoretically modeling the inspiral and coalescence of neutron star and black hole binaries, which, in turn, are among the most promising sources of gravitational radiation for future…
A neutron star in a compact binary is expected to be well-approximated by a barotropic flow during the inspiral phase. During the merger phase, where tidal disruption and shock-heating occur, a baroclinic description is needed instead. In…
Context: Relaxation theory offers a straightforward method for estimating the energy that is released when a magnetic field becomes unstable, as a result of continual convective driving. Aims: We present new results obtained from nonlinear…
We report our new code (named SACRA) for numerical relativity simulations in which an adaptive mesh refinement algorithm is implemented. In this code, the Einstein equations are solved in the BSSN formalism with a fourth-order finite…
We describe a semidefinite relaxation method which finds lower bounds to the ground state energy of a quantum Hamiltonian subject to Hermitian linear constraints along with approximations of ground state expectation values. We show that…
We present a method for studying the secular gravitational dynamics of hierarchical multiple systems consisting of nested binaries, which is valid for an arbitrary number of bodies and arbitrary hierarchical structure. We derive the…
In this paper, we present a method for the Hamiltonian simulation in the context of eigenvalue estimation problems which improves earlier results dealing with Hamiltonian simulation through the truncated Taylor series. In particular, we…
The present work investigates the numerical evolution of linearized oscillations of non-rotating, spherically symmetric neutron stars within the framework of general relativity. We derive the appropriate equations using the (3+1)-formalism.…
The local relaxation algorithm is promising for fast solution of Poisson's equations, which computes the electric field distribution in a stepwise manner via local curl-free updates while strictly enforcing Gauss's law. We propose a novel…
Equilibria of binary neutron stars in close circular orbits are computed numerically in a waveless formulation: The full Einstein-relativistic-Euler system is solved on an initial hypersurface to obtain an asymptotically flat form of the…
Many promising quantum applications depend on the efficient quantum simulation of an exponentially large sparse Hamiltonian, a task known as sparse Hamiltonian simulation, which is fundamentally important in quantum computation. Although…
We experiment with modifications of the BSSN form of the Einstein field equations (a reformulation of the ADM equations) and demonstrate how these modifications affect the stability of numerical black hole evolution calculations. We use…
This report is concerned with the efficiency of numerical methods for simulating quantum spin systems, with the aim to implement an improved method for simulation of a time-dependent Hamiltonian that displays chirped pulses at a high…
Simulating the time-evolution of quantum mechanical systems is BQP-hard and expected to be one of the foremost applications of quantum computers. We consider classical algorithms for the approximation of Hamiltonian dynamics using…
We explore how a recently developed analytical black-hole binary spacetime can be extended using numerical simulations to go beyond the slow-inspiral phase. The analytic spacetime solves the Einstein field equations approximately, with the…
We describe a simple method for simulating time-independent Hamiltonian $H$ that could be decomposed as $H = \sum_{i=1}^m H_i$ where each $H_i$ can be efficiently simulated. Approaches relying on product formula generally work by splitting…
The problem of simulating sparse Hamiltonians on quantum computers is well studied. The evolution of a sparse N x N Hamiltonian H for time t can be simulated using O(||Ht||poly(log N)) operations, which is essentially optimal due to a…
We present an efficient algorithm for simulating the time evolution due to a sparse Hamiltonian. In terms of the maximum degree d and dimension N of the space on which the Hamiltonian H acts for time t, this algorithm uses (d^2(d+log*…
The Helstrom measurement (HM) is known to be the optimal strategy for distinguishing non-orthogonal quantum states with minimum error. Previously, a binary classifier based on classical simulation of the HM has been proposed. It was…