Search results

Page title matches

• Category:Quantum Information
  Pages related to quantum information theory and quantum complexity theory.
  32 members (0 subcategories, 0 files) - 20:42, 18 November 2012

Page text matches

• Category:Quantum Information
  Pages related to quantum information theory and quantum complexity theory.
  32 members (0 subcategories, 0 files) - 20:42, 18 November 2012
• Template:CZ-Categories
  [[Category:Quantum Information]]
  276 bytes (27 words) - 03:10, 18 November 2012
• Complexity Zoo Exhibit
  <b>Special [[Complexity Zoo]] Exhibit:</b> Classes of Quantum States and Probability Distributions ...This phylum consists of classes, not of problems or languages, but of <i>quantum states</i> and <i>probability distributions</i>. Well, actually, infinite
  15 KB (2,601 words) - 03:10, 18 November 2012
• Complexity Zoo:Z
  ===== <span id="zamcc" style="color:red">ZAM^cc</span>: Zero-Information Arthur-Merlin Communication Complexity ===== ...pt that on each yes-input, the distribution of Merlin’s proof must leak no information about the input and moreover, this proof must be unique for each outcome of
  6 KB (1,040 words) - 03:36, 22 October 2022
• Complexity Zoo:Q
  ===== <span id="qac0" style="color:red">QAC⁰</span>: Quantum [[Complexity Zoo:A#ac0|AC⁰]] ===== ...decision problems solvable by a family of constant-depth, polynomial-size quantum circuits. Here each layer of the circuit is a tensor product of one-qubit
  29 KB (4,667 words) - 19:31, 15 November 2023
• Complexity Zoo:E
  See [[zooref#har87|[Har87]]] for more information. ...n id="eqbp" style="color:red">k-EQBP</span>: Width-k Polynomial-Time Exact Quantum Branching Programs =====
  15 KB (2,625 words) - 11:06, 22 June 2023
• User:Timeroot
  I'm trying to compile information on types of graph containment. ==Quantum classes==
  9 KB (1,293 words) - 17:48, 12 June 2020
• Complexity Zoo:D
  ===== <span id="dqc1" style="color:red">DQC1</span>: Deterministic Quantum Computing with 1 Clean Bit ===== ===== <span id="dqp" style="color:red">DQP</span>: Dynamical Quantum Polynomial-Time =====
  11 KB (1,828 words) - 21:54, 25 March 2023
• Complexity Zoo:C
  See [[zooref#tor91|[Tor91]]] or [[zooref#aw90|[AW90]]] for more information. ...an id="cqsigma2" style="color:red">cq-&#931;₂</span>: Classical-Quantum-[[Complexity Zoo:S#sigma2p|&#931;₂P]] =====
  21 KB (3,514 words) - 17:35, 7 November 2022
• Complexity Zoo:R
  ===== <span id="rbqp" style="color:red">RBQP</span>: Strict Quantum [[#rp|RP]] ===== ..."yes," the other that the answer is "no." Note that the verifier can hide information from the provers. Public-coin RG amounts to {{zcls|s|saptime}}, which equa
  13 KB (2,129 words) - 22:19, 21 October 2022
• Complexity Zoo:S
  ...zer Yakaryılmaz and A.C. Cem Say. Languages recognized by nondeterministic quantum finite automata. https://arxiv.org/abs/0902.2081v2</ref>, where it was show ===== <span id="sbqp" style="color:red">SBQP</span>: Small Bounded-Error Quantum Polynomial-Time =====
  31 KB (5,118 words) - 09:33, 2 May 2024
• Petting Zoo
  ...and complex beasts lurking in the main zoo. It will be a gentler source of information about major complexity classes, problems, and reductions. It is meant to be ...than a polynomial number of gates drawn from a specified set of universal quantum gates (such as the Toffoli and Hadamard gates, or the CNOT and ''&pi;''/8 g
  28 KB (4,777 words) - 19:15, 18 February 2020
• Complexity Zoo:N
  ...span id="naCQP" style="color:red">naCQP</span>: non-adaptive Collapse-free Quantum Polynomial time ===== As an application of this result, NC¹ can be simulated on a quantum computer with three qubits, one initialized to a pure state and the remaini
  42 KB (6,897 words) - 15:10, 12 April 2024
• Complexity Zoo:A
  ...PostBQP]]/qpoly ([[Complexity Zoo:P#postbqp|PostBQP]] with polynomial-size quantum advice). ...verifier, not the prover or post-selector, who receives the randomized or quantum advice. The prover knows a description of the advice state, but not its mea
  31 KB (5,129 words) - 04:16, 25 October 2023
• Complexity Zoo:P
  J. Flum and M. Grohe. Describing parameterized complexity classes. Information and Computation. ===== <span id="pdqp" style="color:red">PDQP</span>: Product Dynamical Quantum Polynomial time =====
  60 KB (9,966 words) - 06:14, 21 September 2023
• Complexity Zoo References
  Quantum lower bound for the collision problem, Lower bounds for local search by quantum arguments,
  165 KB (23,490 words) - 20:04, 9 May 2024