scientific article; zbMATH DE number 845841
From MaRDI portal
Publication:4864428
zbMATH Open0850.68166MaRDI QIDQ4864428FDOQ4864428
Authors:
Publication date: 18 February 1996
Title of this publication is not available (Why is that?)
Cited In (39)
- Matrices in elimination theory
- A short impossibility proof of quantum bit commitment
- Ramsey-type theorems for metric spaces with applications to online problems
- Mathematical models of quantum computation
- Quantum private query using W state
- The communication complexity of the Hamming distance problem
- Grover search inspired alternating operator ansatz of quantum approximate optimization algorithm for search problems
- Quantum bit string commitment protocol using polarization of mesoscopic coherent states
- Quantum algorithm for classical multidimensional scaling
- Weak coin flipping with small bias
- Automata theory based on quantum logic: Some characterizations
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application
- Permutation patterns in genome rearrangement problems: the reversal model
- An oracle builder's toolkit
- The power word problem in graph products
- Quantum circuits synthesis using Householder transformations
- Hierarchy and equivalence of multi-letter quantum finite automata
- A programming language characterizing quantum polynomial time
- Application of quantum approximate optimization algorithm to job shop scheduling problem
- A note on quantum sequential machines
- Determining the equivalence for one-way quantum finite automata
- Matrix rank and communication complexity
- Universal quantum computation by scattering in the Fermi–Hubbard model
- New bounds on classical and quantum one-way communication complexity
- Compression techniques in group theory
- Representation of hypergeometric products of higher nesting depths in difference rings
- Quantum path parallelism: a circuit-based approach to text searching
- Lower bounds for predecessor searching in the cell probe model
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Computing crossing numbers in quadratic time
- Quantum one-way versus classical two-way communication in XOR games
- A theory of computation based on quantum logic. I
- Overview: recent development and applications of reduction and lackadaisicalness techniques for spatial search quantum walk in the near term
- Exact distributed quantum algorithm for generalized Simon's problem
- A size-depth trade-off for the analog computation of Boolean functions
- Fully persistent B-trees
- Real computations with fake numbers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4864428)
