Related papers: iOI: an Iterative Orbital Interaction Approach for…
The Quantum Approximate Optimization Algorithm (QAOA) is a quantum-classical hybrid algorithm intending to find the ground state of a target Hamiltonian. Theoretically, QAOA can obtain the approximate solution if the quantum circuit is deep…
The multiphoton ionization of hydrogen by a strong bichromatic microwave field is a complex process prototypical for atomic control research. Periodic orbit analysis captures this complexity: Through the stability of periodic orbits we can…
Autonomous exploration of unknown environments with aerial vehicles remains a challenge, especially in perceptually degraded conditions. Dust, fog, or a lack of visual or LiDAR-based features results in severe difficulties for state…
A general program to show quantum-classical correspondence for bound conservative integrable and chaotic systems is described. The method is applied to integrable systems and the nature of the approach to the classical limit, the…
The capability to control molecular rotation for field-free orientation, which arranges molecules in specific spatial directions without external fields, is crucial in physics, chemistry, and quantum information science. However,…
Initial orbit determination (IOD) from line-of-sight (i.e., bearing) measurements is a classical problem in astrodynamics. Indeed, there are many well-established methods for performing the IOD task when given three line-of-sight…
Inverse optimal control (IOC) aims to estimate the underlying cost that governs the observed behavior of an expert system. However, in practical scenarios, the collected data is often corrupted by noise, which poses significant challenges…
We present a fully variational locally scaled self-interaction corrected (SIC) energy functional using complex optimal orbitals. This represents an important milestone for fully variational SIC energy functionals, which have been shown to…
Quantum-matter theory (QMT), based on the Schr\"odinger or Dirac equations, is firmly established for both intra- and intermolecular interactions. However, there are two key issues with QMT. First, its applicability to large molecular…
We consider a bipartite quantum object, composed of a quantum system and a quantum actuator which is periodically reset. We show that the reduced dynamics of the system approaches unitarity as the reset frequency of the actuator is…
The proposal for quantum computing with rare-earth-ion qubits in inorganic crystals makes use of the inhomogeneous broadening of optical transitions in the ions to associate individual qubits with ions responding to radiation in selected…
In the noisy-intermediate-scale-quantum era, Variational Quantum Eigensolver (VQE) is a promising method to study ground state properties in quantum chemistry, materials science, and condensed physics. However, general quantum eigensolvers…
The Quantum Approximate Optimization Algorithm (QAOA) is suggested as a promising application on early quantum computers. Here, a quantum-inspired classical algorithm, the mean-field Approximate Optimization Algorithm (mean-field AOA), is…
This series of papers has two broader aims: 1) Construct a theory for multi-partite open quantum systems comprising several layers of structure with self-consistent back-actions. Develop the graded influence action formalism…
The problem of the reason of physical motion needs a review in the framework of quantum theory. The Aristotle's mistake, Galileo-Newton progress, Einstein physical geometry established the fundamental role of the spacetime geometry in the…
The multi-configurational self-consistent field theory is considered the standard starting point for almost all multireference approaches required for strongly-correlated molecular problems. The limitation of the approach is generally given…
If one has to attain high accuracy over long timescales during the numerical computation of the N-body problem, the method called Lie-integration is one of the most effective algorithms. In this paper we present a set of recurrence…
Combinatorial optimization problems on graphs have broad applications in science and engineering. The Quantum Approximate Optimization Algorithm (QAOA) is a method to solve these problems on a quantum computer by applying multiple rounds of…
Quantum computing is a computational paradigm with the potential to outperform classical methods for a variety of problems. Proposed recently, the Quantum Approximate Optimization Algorithm (QAOA) is considered as one of the leading…
In the wake of quantum computing advancements and quantum algorithmic progress, quantum algorithms are increasingly being employed to address a myriad of combinatorial optimization problems. Among these, the Independent Domination Problem…