Related papers: Weighted Nested Commutators for Scalable Counterdi…
The theoretical analysis of the Adiabatic Quantum Computation protocol presents several challenges resulting from the difficulty of simulating, with classical resources, the unitary dynamics of a large quantum device. We present here a…
We propose a systematic approach to the basis set extension for nonadiabatic dynamics of entangled combination of nuclear coherent states (CSs) evolving according to the time-dependent variational principle (TDVP). TDVP provides a rigorous…
This is an extended version of a technical note accepted for publication in IEEE Transactions on Automatic Control. The note proposes an Input to State practically Stable (ISpS) formulation of distributed nonlinear model predictive…
The antisymmetrized geminal power (AGP) is equivalent to the number projected Bardeen-Cooper-Schrieffer (PBCS) wavefunction. It is also an elementary symmetric polynomial (ESP) state. We generalize previous research on deterministically…
We provide an architecture for a multimode quantum battery (QB) based on the framework of continuous variable (CV) systems. We examine the performance of the battery by using a generic class of multimode initial states whose parameters can…
Quantum computers attract much attention as they promise to outperform their classical counterparts in solving certain type of problems. One of them with practical applications in quantum chemistry is simulation of complex quantum systems.…
Nonadiabatic geometric quantum computation (NGQC) has emerged as an excellent proposal for achieving fast and robust quantum control against control errors. However, previous NGQC protocols could not be strongly resilient against the noise…
In recent years, the $GW$ method has emerged as a reliable tool for computing core-level binding energies. The contour deformation (CD) technique has been established as an efficient, scalable, and numerically stable approach to compute the…
Convolutional neural networks (CNNs) are computationally intensive and often accelerated using crossbar-based in-memory computing (IMC) architectures. However, large convolutional layers must be partitioned across multiple crossbars,…
The recent WSNet [1] is a new model compression method through sampling filterweights from a compact set and has demonstrated to be effective for 1D convolutionneural networks (CNNs). However, the weights sampling strategy of WSNet…
We study a deformation of the counterdiabatic-driving Hamiltonian as a systematic strategy for an adiabatic control of quantum states. Using a unitary transformation, we design a convenient form of the driver Hamiltonian. We apply the…
Transitionless quantum driving, also known as counterdiabatic driving, is a unique shortcut technique to adiabaticity, enabling a fast-forward evolution to the same target quantum states as those in the adiabatic case. However, as nothing…
We introduce the idea of using adiabatic rotation to generate superpositions of a large class of quantum states. For quantum computing this is an interesting alternative to the well-studied "straight line" adiabatic evolution. In ways that…
Conformal Predictive Systems (CPS) offer a versatile framework for constructing predictive distributions, allowing for calibrated inference and informative decision-making. However, their applicability has been limited to scenarios adhering…
Many years have passed since the conception of the quintessential method of shortcut to adiabaticity known as counterdiabatic driving (or transitionless quantum driving). Yet, this method appears to be energetically cost-free and thus…
We report on an analog computing system with coupled non-linear oscillators which is capable of solving complex combinatorial optimization problems using the weighted Ising model. The circuit is composed of a fully-connected 4-node LC…
Quantum adiabatic dynamics is the crucial element of adiabatic quantum computing and quantum annealing. Shortcuts to adiabaticity enable acceleration of the computational time by suppressing unwanted non-adiabatic processes with designed…
Quantum Approximate Optimization Algorithm (QAOA) is one of the fundamental variational quantum algorithms, while a version of QAOA that includes counterdiabatic driving, termed Digitized Counterdiabatic QAOA (DC-QAOA), is generally…
Implementing holonomic quantum computation is a challenging task as it requires complicated interaction among multilevel systems. Here we propose to implement nonadiabatic holonomic quantum computation based on dressed-state qubits in…
Observable estimation is a core primitive in NISQ-era algorithms targeting quantum chemistry applications. To reduce the state preparation overhead required for accurate estimation, recent works have proposed various simultaneous…