Results 11 to 20 of about 50 (45)
Forum of Mathematics, SigmaWe obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials P $\mathcal P$ script upper P restricted to an algebraic ...
Saugata Basu, Laxmi Parida
doaj +1 more source
Parameterized quantum circuit for binary and multi classification
ArrayMachine learning models achieve strong predictive performance by uncovering hidden patterns and structures within data. Quantum Machine Learning (QML) extends this capability by leveraging principles of quantum mechanics to address complex classification
S. Megala, P. Ragukumar, Neelu Khare
doaj +1 more source
InPrimeThe advent of quantum computing has introduced a revolutionary shift in computational paradigms, with the potential to address complex problems beyond the reach of classical systems.
Milad Rahmati
doaj +1 more source
On coordination games with quantum correlations
Quantum games, Coordination game, Correlated equilibrium, 91A28, 91A99, 81P68,
Vladislav Kargin
core +1 more source
Quantum Lower Bound for the Collision
, 2004 : We extend Aaronson and Shi’s quantum lower bound for the r-to-one collision problem. An r-to-one function is one where every element of the image has exactly r preimages. The r-to-one collision problem is to distinguish between one-to-one functions and
Samuel Kutin, Problem Small Range
core
Benchmarking Classical, Hybrid, and Quantum Annealing Workflows on a Structured Control QUBO
We benchmark classical, simulated-quantum, hybrid, and direct quantum-annealing workflows on a structured binary control problem formulated as a quadratic unconstrained binary optimization (QUBO) model.
Maryam Bahrami Zanjani, Hamze Alavirad
core +1 more source
HIGHER-RANK NUMERICAL RANGES AND DILATIONS
, 2008 . For any n-by-n complex matrix A and any k, 1 ≤ k ≤ n, let Λ k(A) = {λ ∈ C: X ∗ AX = λI k for some n-by-k X satisfying X ∗ X = I k} be its rank-k numerical range.
Hwa-long Gau, Chi-kwong Li, Pei Yuan Wu
core
An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization. [PDF]
Entropy (Basel), 2023 Wu Z +4 more
europepmc +1 more source
Certified Quantum Computation in Isabelle/HOL. [PDF]
J Autom Reason, 2021 Bordg A, Lachnitt H, He Y.
europepmc +1 more source
, 2008 , Abstract. We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolmogorov complexity to query complexity.
Frédéric Magniez, Sophie Laplante
core