scientific article; zbMATH DE number 845841
From MaRDI portal
zbMath0850.68166MaRDI QIDQ4864428
No author found.
Publication date: 18 February 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Computing crossing numbers in quadratic time, The communication complexity of the Hamming distance problem, Automata theory based on quantum logic: Some characterizations, Permutation patterns in genome rearrangement problems: the reversal model, A programming language characterizing quantum polynomial time, An oracle builder's toolkit, Grover search inspired alternating operator ansatz of quantum approximate optimization algorithm for search problems, Application of quantum approximate optimization algorithm to job shop scheduling problem, Representation of hypergeometric products of higher nesting depths in difference rings, Overview: recent development and applications of reduction and lackadaisicalness techniques for spatial search quantum walk in the near term, Quantum one-way versus classical two-way communication in XOR games, Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness, Another approach to the equivalence of measure-many one-way quantum finite automata and its application, Quantum circuits synthesis using Householder transformations, A short impossibility proof of quantum bit commitment, Universal quantum computation by scattering in the Fermi–Hubbard model, Matrix rank and communication complexity, A size-depth trade-off for the analog computation of Boolean functions, Quantum private query using W state, Lower bounds for predecessor searching in the cell probe model, Automata theory based on complete residuated lattice-valued logic: Turing machines, Quantum bit string commitment protocol using polarization of mesoscopic coherent states, Ramsey-type theorems for metric spaces with applications to online problems, Hierarchy and equivalence of multi-letter quantum finite automata, Determining the equivalence for one-way quantum finite automata, Sensitivity, affine transforms and quantum communication complexity, Matrices in elimination theory, Weak coin flipping with small bias, New bounds on classical and quantum one-way communication complexity, A note on quantum sequential machines, A theory of computation based on quantum logic. I, Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems, Unnamed Item, Real computations with fake numbers, Mathematical models of quantum computation, Compression techniques in group theory
