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 two qubits in state |00 rangle . Your task is to create the following state on them: frac{1}{ sqrt{3}} big( |00 rangle + |01 rangle + |10 rangle) You have to implement an operation which takes an array of 2 qubits as an input and has no output. The "output" of your solution is the state in which it left the input 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 |
|
62113390 |
An10nim4ik29 |
A1 |
Oct. 8, 2019, 12:46 p.m. |
OK |
Q# |
TESTS |
1 |
61 |
0 |
|
|
|
50649747 |
Picks |
A1 |
March 1, 2019, 5:09 p.m. |
OK |
Q# |
TESTS |
1 |
61 |
0 |
|
|
|
55707393 |
xsmartx |
A1 |
June 18, 2019, 8:21 a.m. |
OK |
Q# |
TESTS |
1 |
77 |
0 |
|
|
|
55707332 |
xsmartx |
A1 |
June 18, 2019, 8:19 a.m. |
OK |
Q# |
TESTS |
1 |
77 |
0 |
|
|
|
50657678 |
verngutz |
A1 |
March 1, 2019, 8:29 p.m. |
OK |
Q# |
TESTS |
1 |
77 |
0 |
|
|
|
50653104 |
ollpu |
A1 |
March 1, 2019, 6:25 p.m. |
OK |
Q# |
TESTS |
1 |
77 |
0 |
|
|
|
50692685 |
hansencs |
A1 |
March 2, 2019, 4:27 p.m. |
OK |
Q# |
TESTS |
1 |
92 |
0 |
|
|
|
50663376 |
jpdiazvaz |
A1 |
March 2, 2019, 1:51 a.m. |
OK |
Q# |
TESTS |
1 |
92 |
0 |
|
|
|
50653254 |
dwai009 |
A1 |
March 1, 2019, 6:29 p.m. |
OK |
Q# |
TESTS |
1 |
92 |
0 |
|
|
|
55707617 |
xsmartx |
A1 |
June 18, 2019, 8:29 a.m. |
OK |
Q# |
TESTS |
1 |
93 |
0 |
|
|
remove filters
Back to search problems