Related papers: Quantum System Partitioning at the Single-Particle…
For many decades, quantum chemical method development has been dominated by algorithms which involve increasingly complex series of tensor contractions over one-electron orbital spaces. Procedures for their derivation and implementation…
Standard quantum mechanics is viewed as a limit of a cut system with artificially restricted dimension of a Hilbert space. Exact spectrum of cut momentum and coordinate operators is derived and the limiting transition to the infinite…
Network partitioning has gained recent attention as a pathway to enable decentralized operation and control in large-scale systems. This paper addresses the interplay between partitioning, observability, and sensor placement (SP) in dynamic…
In this work we investigate methods to improve the efficiency and scalability of quantum algorithms for quantum chemistry applications. We propose a transformation of the electronic structure Hamiltonian in the second quantization framework…
While quantum algorithms for solving large scale systems of linear equations offer potentially exponential speedups, their application has largely been confined to sparse matrices. This work extends the scope of these algorithms to a broad…
In numerical studies of the dynamics of unbound quantum mechanical systems, absorbing boundary conditions are frequently applied. Although this certainly provides a useful tool in facilitating the description of the system, its applications…
The Schmidt decomposition is the go-to tool for measuring bipartite entanglement of pure quantum states. Similarly, it is possible to study the entangling features of a quantum operation using its operator-Schmidt, or tensor product…
Any Hilbert space with composite dimension can be factorized into a tensor product of smaller Hilbert spaces. This allows to decompose a quantum system into subsystems. We propose a simple tractable model for a constructive study of…
It has been found that quantum corrections can substantially affect the classical results of tracking for trajectories close to the separatrix. Hence the development of a basic formalism for obtaining the quantum maps for any particle beam…
Distributed quantum computing (DQC) is a new paradigm aimed at scaling up quantum computing via the interconnection of smaller quantum processing units (QPUs). Shared entanglement allows teleportation of both states and gates between QPUs.…
In this paper, we first design a type of Bang-Bang (BB) operation group to reduce the phase decoherence in a {\Xi}-type n-level quantum system based on the dynamical decoupling mechanism. Then, we derive two kinds of dynamical decoupling…
In this thesis, I go through the well-known solutions to the one and two-particle systems trapped in a quantum harmonic oscillator and then continue to the three, four and many-body quantum systems. This is done by developing new analytical…
A universal quantum computer can simulate diverse quantum systems, with electronic structure for chemistry offering challenging problems for practical use cases around the hundred-qubit mark. While current quantum processors have reached…
We investigate the separability of arbitrary dimensional tripartite sys- tems. By introducing a new operator related to transformations on the subsystems a necessary condition for the separability of tripartite systems is presented.
Owing to the computational complexity of electronic structure algorithms running on classical digital computers, the range of molecular systems amenable to simulation remains tightly circumscribed even after many decades of work. Quantum…
Despite the recent progress in quantum computational algorithms for chemistry, there is a dearth of quantum computational simulations focused on material science applications, especially for the energy sector, where next generation sorbing…
Quantum computers face inherent scaling challenges, a fact that necessitates investigation of distributed quantum computing systems, whereby scaling is achieved through interconnection of smaller quantum processing units. However,…
We present a review of recent research on quantum entanglement, with special emphasis on entanglement between single atoms, processing of an encoded entanglement and its temporary evolution. Analysis based on the density matrix formalism…
Simulating quantum circuits (QC) on high-performance computing (HPC) systems has become an essential method to benchmark algorithms and probe the potential of large-scale quantum computation despite the limitations of current quantum…
In this paper, we present a new method to solve a certain type of Semidefinite Programming (SDP) problems. These types of SDPs naturally arise in the Quadratic Convex Reformulation (QCR) method and can be used to obtain dual bounds of…