Skip to main content

Questions tagged [bernstein-vazirani-algorithm]

For questions on the Bernstein-Vazirani algorithm.

1 vote
1 answer
562 views

I have been running a code for collecting output from the IBM backend for the Vazirani algorithm. Due to the recent deprecation of certain modules, I had to rewrite the code. The main change was using ...
A Y's user avatar
  • 55
2 votes
0 answers
99 views

Initially when I first saw an old question about using a quantum computer to solve Wordle, I had dismissed it as nothing but a cute gimmicky mashup. But upon further consideration, the Bernstein-...
Mark Spinelli's user avatar
0 votes
1 answer
60 views

I have this implementation of the Bernstein-Vazirani Algorithm for Qiskit Aer: ...
Ícaro Lorran's user avatar
4 votes
1 answer
265 views

Recently I've found the recursive Bernstein-Vazirani algorithm which is explained quite good in this paper CSE 599d - Quantum Computing The Recursive and Nonrecursive Bernstein-Vazirani Algorithm of ...
aghin's user avatar
  • 159
2 votes
1 answer
155 views

In Bernstein-Vazirani algorithm, we can see the application of $CX$ gates from each qubit that represents the bit in state 1, onto the $|-\rangle$ state. It seems clear to me that the $CX$ will apply ...
user10420480's user avatar
2 votes
1 answer
515 views

I am reading a book section about the difference between the Deutsch-Jozsa and the Bernstein-Vazirani Algorithm and here is the text: As with DJ, the goal of BV is also to ascertain the nature of a ...
Hamideh's user avatar
  • 289
2 votes
1 answer
186 views

Instead of using n inputs (000...01, 000...10, ..., 100...00) and multiplying each one with the hidden number x, why can't we just try one input: 111...11 ? I can't think of an example of a binary ...
Confused engineer's user avatar
8 votes
1 answer
350 views

Peter Shor has given wonderful accounts of the development of his algorithm, with a lot of detail on the activity in the field at around the early-mid 90's. He's been very free about emphasizing that ...
Mark Spinelli's user avatar
1 vote
1 answer
337 views

My question is with regards to the implementation from the Qiskit textbook. From my understanding the algorithm is for finding out what an unknown bit-string is which in the classical case requires N ...
timmy1691's user avatar
0 votes
1 answer
140 views

In the Bernstein- Vazirani Algorithm, we check whether the secret number has a '1' at a specific index of the number. If it's 1, we apply a CNOT gate, and then the algorithm gives the accurate value ...
Gandalf73's user avatar
  • 133
1 vote
1 answer
746 views

I was reading about the Jordan gradient algorithm(https://arxiv.org/pdf/quant-ph/0405146.pdf) and I am a bit confused about one of the phrases: Next, use the blackbox to compute f and add it modulo $...
MeltedStatementRecognizing's user avatar
0 votes
2 answers
186 views

In Bernstein-Vazirani Algorithm, the role of the last qubit (here, $q_7$) is simply to dish out negative relative phases to each qubit representing a $1$ through the use of $\text{CNOT}$s. But if we ...
Vinay Sharma's user avatar
3 votes
1 answer
193 views

The Bernstein Vazirani can solve s for f(x) = s(dot product) x mod 2. My question is if its possible to modify this to work for mod 3,4 etc. Is this even possible? Edit: Whats the probability of the ...
user avatar
2 votes
1 answer
159 views

Can the Bernstein-Vazirani algorithm be applied to a remote classical function? As in, a function we are not able to set up an oracle for and is completely classical?
Random's user avatar
  • 43
4 votes
3 answers
441 views

In both of these example algorithms, the Classical one is restricted to a single bit of output, while the Quantum one is allowed to use information exposed from multiple bits. There is no question ...
user20364's user avatar

15 30 50 per page