Master this deck with 19 terms through effective study methods.
Generated from uploaded pdf
Inefficient for large datasets and cannot represent quantum superpositions.
Encodes information as both 0 and 1 simultaneously.
Allows multiple values to be represented at once.
Measuring one qubit determines the state of its partner instantly.
Visualizing a single-qubit state as a point on a unit sphere.
Derives from the state space rather than hardware duplication.
Amplifies correct outcomes and cancels incorrect ones.
Searches an unordered database in O(sqrt(N)) time.
Factors integers in polynomial time, unlike classical methods.
Determines if a function is constant or balanced with one query.
Finds a hidden binary string using a single oracle query.
Increases the probability of measuring the correct answer.
Collapses to one of the basis states, revealing classical information.
Requires up to 2^(n-1) + 1 evaluations of the function.
Requires only one query to determine the hidden string.
Creates superposition by transforming |0> to (|0> + |1>)/sqrt(2).
Always yields |0...0> for all qubits.
High noise and decoherence affect qubit stability.
Maintaining coherence across large numbers of qubits.