Faster access than browser!
22 relations: Black box, BPP (complexity), BQP, Computational complexity theory, Computational problem, Decision tree model, Deutsch–Jozsa algorithm, Discrete uniform distribution, EQP (complexity), Hadamard transform, Hidden subgroup problem, Injective function, Linear independence, Mathematical proof, Measurement in quantum mechanics, P (complexity), Quantum algorithm, Quantum computing, Randomized algorithm, Shor's algorithm, Tensor product, Wave interference.
Black box
In science, computing, and engineering, a black box is a device, system or object which can be viewed in terms of its inputs and outputs (or transfer characteristics), without any knowledge of its internal workings.
New!!: Simon's problem and Black box · See more »
BPP (complexity)
In computational complexity theory, BPP, which stands for bounded-error probabilistic polynomial time is the class of decision problems solvable by a probabilistic Turing machine in polynomial time with an error probability bounded away from 1/2 for all instances.
New!!: Simon's problem and BPP (complexity) · See more »
BQP
In computational complexity theory, BQP (bounded-error quantum polynomial time) is the class of decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances.
New!!: Simon's problem and BQP · See more »
Computational complexity theory
Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.
New!!: Simon's problem and Computational complexity theory · See more »
Computational problem
In theoretical computer science, a computational problem is a mathematical object representing a collection of questions that computers might be able to solve.
New!!: Simon's problem and Computational problem · See more »
Decision tree model
In computational complexity and communication complexity theories the decision tree model is the model of computation or communication in which an algorithm or communication process is considered to be basically a decision tree, i.e., a sequence of branching operations based on comparisons of some quantities, the comparisons being assigned the unit computational cost.
New!!: Simon's problem and Decision tree model · See more »
Deutsch–Jozsa algorithm
The Deutsch–Jozsa algorithm is a quantum algorithm, proposed by David Deutsch and Richard Jozsa in 1992 with improvements by Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca in 1998.
New!!: Simon's problem and Deutsch–Jozsa algorithm · See more »
Discrete uniform distribution
In probability theory and statistics, the discrete uniform distribution is a symmetric probability distribution whereby a finite number of values are equally likely to be observed; every one of n values has equal probability 1/n.
New!!: Simon's problem and Discrete uniform distribution · See more »
EQP (complexity)
In computational complexity theory, EQP (sometimes called QP), which stands for exact quantum polynomial time, is the class of decision problems solvable by a quantum computer which outputs the correct answer with probability 1 and runs in polynomial time.
New!!: Simon's problem and EQP (complexity) · See more »
Hadamard transform
The Hadamard transform (also known as the Walsh–Hadamard transform, Hadamard–Rademacher–Walsh transform, Walsh transform, or Walsh–Fourier transform) is an example of a generalized class of Fourier transforms.
New!!: Simon's problem and Hadamard transform · See more »
Hidden subgroup problem
The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science.
New!!: Simon's problem and Hidden subgroup problem · See more »
Injective function
In mathematics, an injective function or injection or one-to-one function is a function that preserves distinctness: it never maps distinct elements of its domain to the same element of its codomain.
New!!: Simon's problem and Injective function · See more »
Linear independence
In the theory of vector spaces, a set of vectors is said to be if one of the vectors in the set can be defined as a linear combination of the others; if no vector in the set can be written in this way, then the vectors are said to be.
New!!: Simon's problem and Linear independence · See more »
Mathematical proof
In mathematics, a proof is an inferential argument for a mathematical statement.
New!!: Simon's problem and Mathematical proof · See more »
Measurement in quantum mechanics
The framework of quantum mechanics requires a careful definition of measurement.
New!!: Simon's problem and Measurement in quantum mechanics · See more »
P (complexity)
In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class.
New!!: Simon's problem and P (complexity) · See more »
Quantum algorithm
In quantum computing, a quantum algorithm is an algorithm which runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation.
New!!: Simon's problem and Quantum algorithm · See more »
Quantum computing
Quantum computing is computing using quantum-mechanical phenomena, such as superposition and entanglement.
New!!: Simon's problem and Quantum computing · See more »
Randomized algorithm
A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic.
New!!: Simon's problem and Randomized algorithm · See more »
Shor's algorithm
Shor's algorithm, named after mathematician Peter Shor, is a quantum algorithm (an algorithm that runs on a quantum computer) for integer factorization formulated in 1994.
New!!: Simon's problem and Shor's algorithm · See more »
Tensor product
In mathematics, the tensor product of two vector spaces and (over the same field) is itself a vector space, together with an operation of bilinear composition, denoted by, from ordered pairs in the Cartesian product into, in a way that generalizes the outer product.
New!!: Simon's problem and Tensor product · See more »
Wave interference
In physics, interference is a phenomenon in which two waves superpose to form a resultant wave of greater, lower, or the same amplitude.
New!!: Simon's problem and Wave interference · See more »
Redirects here:
Simon algorithm, Simon's Algorithm, Simon's algorithm, Simons algorithm.
References
[1] https://en.wikipedia.org/wiki/Simon's_problem
