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 which are guaranteed to be in one of the Bell states: Your task is to perform necessary operations and measurements to figure out which state it was and to return the index of that state (0 for , 1 for etc.). The state of the qubits after the operations does not matter. You have to implement an operation which takes an array of two qubits as an input and returns an integer. 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 |
|
39850069 |
JeffreyLC |
E |
July 1, 2018, 7:51 p.m. |
OK |
Q# |
TESTS |
1 |
187 |
0 |
|
2400 |
|
39867039 |
wreck_count |
E |
July 2, 2018, 11:56 a.m. |
OK |
Q# |
TESTS |
1 |
202 |
0 |
|
2400 |
|
39865563 |
Brankonymous |
E |
July 2, 2018, 10:56 a.m. |
OK |
Q# |
TESTS |
1 |
202 |
0 |
|
2400 |
|
39817726 |
verngutz |
E |
July 1, 2018, 9:47 a.m. |
OK |
Q# |
TESTS |
1 |
202 |
0 |
|
2400 |
|
39814972 |
hamtory |
E |
July 1, 2018, 7:38 a.m. |
OK |
Q# |
TESTS |
1 |
202 |
0 |
|
2400 |
|
39806378 |
fc-lib-xyz |
E |
June 30, 2018, 8 p.m. |
OK |
Q# |
TESTS |
1 |
202 |
0 |
|
2400 |
|
39796326 |
tanzaku |
E |
June 30, 2018, 11:40 a.m. |
OK |
Q# |
TESTS |
1 |
202 |
0 |
|
2400 |
|
39780783 |
f4ded4k |
E |
June 29, 2018, 7:55 p.m. |
OK |
Q# |
TESTS |
1 |
202 |
0 |
|
2400 |
|
39778196 |
mr_ragnarson |
E |
June 29, 2018, 6:29 p.m. |
OK |
Q# |
TESTS |
1 |
202 |
0 |
|
2400 |
|
39775960 |
asvasil |
E |
June 29, 2018, 5:20 p.m. |
OK |
Q# |
TESTS |
1 |
202 |
0 |
|
2400 |
remove filters
Back to search problems