Solutions are presented as using the least memory and the fastest execution time. It also takes the top
10 most recent solutions from each language. If you want to limit to a specific index, click the
"Solved" button and go to that problem.
Problems
B'You are given N qubits (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89N xe2 x80 x89 xe2 x89 xa4 xe2 x80 x898) in zero state . Your task is to generate an equal superposition of all 2N basis vectors on N qubits: For example, You have to implement an operation which takes an array of N qubits as an input and has no output. The "output" of the operation is the state in which it leaves the qubits. Your code should have the following signature: '... |
Tutorials
Submissions
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
40045701 |
Shamsutdin |
A1 |
July 6, 2018, 10:16 p.m. |
OK |
Q# |
TESTS |
8 |
202 |
0 |
|
1900 |
40034952 |
johnathan79717 |
A1 |
July 6, 2018, 4:08 p.m. |
OK |
Q# |
TESTS |
8 |
202 |
0 |
|
1900 |
40089798 |
leeyikjiun |
A1 |
July 8, 2018, 4:02 p.m. |
OK |
Q# |
TESTS |
8 |
218 |
0 |
|
1900 |
40086112 |
Plurm |
A1 |
July 8, 2018, 1:16 p.m. |
OK |
Q# |
TESTS |
8 |
218 |
0 |
|
1900 |
40058558 |
dzamlo |
A1 |
July 7, 2018, 10:49 a.m. |
OK |
Q# |
TESTS |
8 |
218 |
0 |
|
1900 |
40049389 |
rightpeter |
A1 |
July 7, 2018, 3:02 a.m. |
OK |
Q# |
TESTS |
8 |
218 |
0 |
|
1900 |
40047810 |
ryucc |
A1 |
July 7, 2018, 1:16 a.m. |
OK |
Q# |
TESTS |
8 |
218 |
0 |
|
1900 |
40046941 |
251 |
A1 |
July 7, 2018, 12:05 a.m. |
OK |
Q# |
TESTS |
8 |
218 |
0 |
|
1900 |
40046394 |
nakura |
A1 |
July 6, 2018, 11:14 p.m. |
OK |
Q# |
TESTS |
8 |
218 |
0 |
|
1900 |
40043275 |
Electric-tric |
A1 |
July 6, 2018, 8:08 p.m. |
OK |
Q# |
TESTS |
8 |
218 |
0 |
|
1900 |
remove filters
Back to search problems