Quantum Circuit Design using a Progressive Widening Enhanced Monte Carlo Tree Search
This article proposes the Progressive Widening enhanced Monte Carlo Tree Search (PWMCTS) to design parameterized quantum circuits. It improves the efficiency of the previous MCTS‐based techniques in terms of number of quantum circuit evaluation, number of gates and CNOT count.
Vincenzo Lipardi+3 more
wiley +1 more source
The role of identification in data‐driven policy iteration: A system theoretic study
Abstract The goal of this article is to study fundamental mechanisms behind so‐called indirect and direct data‐driven control for unknown systems. Specifically, we consider policy iteration applied to the linear quadratic regulator problem. Two iterative procedures, where data collected from the system are repeatedly used to compute new estimates of ...
Bowen Song, Andrea Iannelli
wiley +1 more source
Connection between the algebra of kernels on the sphere and the Volterra algebra on the one-sheeted hyperboloid : holomorphic “perikernels” [PDF]
J. Bros, G. A. Viano
openalex +1 more source
ABSTRACT We review some known bounds on the eigenvalues of a matrix and use similar techniques to derive bounds for the class of nonlinear eigenproblems and, as a special case, the eigenvalues for LTI systems with delays. We present two classes of results.
Erik I. Verriest
wiley +1 more source
A Method of Ontology Integration for Designing Intelligent Problem Solvers
Nowadays, designing knowledge-based systems which involve knowledge from different domains requires deep research of methods and techniques for knowledge integration, and ontology integration has become the foundation for many recent knowledge ...
Nhon V. Do+2 more
doaj +1 more source
The kernel of Fock representations of Wick algebras with braided operator of coefficients [PDF]
Palle E. T. Jørgensen+2 more
openalex +1 more source
Enhancing generalized spectral clustering with embedding Laplacian graph regularization
Abstract An enhanced generalised spectral clustering framework that addresses the limitations of existing methods by incorporating the Laplacian graph and group effect into a regularisation term is presented. By doing so, the framework significantly enhances discrimination power and proves highly effective in handling noisy data.
Hengmin Zhang+5 more
wiley +1 more source
Notes on Whitehead space of an algebra
Let R be a ring, and denote by [R,R] the group generated additively by the additive commutators of R. When Rn=Mn(R) (the ring of n×n matrices over R), it is shown that [Rn,Rn] is the kernel of the regular trace function modulo [R,R].
M. Arian-Nejad
doaj +1 more source
Approximate‐Guided Representation Learning in Vision Transformer
ABSTRACT In recent years, the transformer model has demonstrated excellent performance in computer vision (CV) applications. The key lies in its guided representation attention mechanism, which uses dot‐product to depict complex feature relationships, and comprehensively understands the context semantics to obtain feature weights.
Kaili Wang+4 more
wiley +1 more source
Putnam-Fuglede theorem and the range-kernel orthogonality of derivations
Let ℬ(H) denote the algebra of operators on a Hilbert space H into itself. Let d=δ or Δ, where δAB:ℬ(H)→ℬ(H) is the generalized derivation δAB(S)=AS−SB and ΔAB:ℬ(H)→ℬ(H) is the elementary operator ΔAB(S)=ASB−S. Given A,B,S∈ℬ(H), we say that the pair (A,B)
B. P. Duggal
doaj +1 more source