Results 11 to 20 of about 42 (41)
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
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
, 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
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
Higher-Dimensional Quantum Walk in Terms of Quantum Bernoulli Noises. [PDF]
Entropy (Basel), 2020 Wang C, Wang C.
europepmc +1 more source
Opial inequality in q-calculus. [PDF]
J Inequal Appl, 2018 Mirković TZ +2 more
europepmc +1 more source
The Poincaré Half-Plane for Informationally-Complete POVMs. [PDF]
Entropy (Basel), 2017 Planat M.
europepmc +1 more source
How to build a device that cannot be built. [PDF]
Quantum Inf Process, 2016 Lomonaco SJ.
europepmc +1 more source