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 a qubit which is guaranteed to be in one of the following states: These states are not orthogonal, and thus can not be distinguished perfectly. Your task is to figure out in which state the qubit is not. More formally: Your solution will be called 1000 times, each time the state of the qubit will be chosen as |A rangle , |B rangle or |C rangle with equal probability. The state of the qubit after the operations does not matter. You have to implement an operation which takes a qubit 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 |
65134566 |
kzo-07-nursultank |
B2 |
Nov. 16, 2019, 5:31 a.m. |
OK |
Q# |
TESTS |
1 |
186 |
0 |
|
|
50776181 |
Svlad_Cjelli |
B2 |
March 4, 2019, 8:38 a.m. |
OK |
Q# |
TESTS |
1 |
186 |
0 |
|
|
50685998 |
Mohan_abhyas |
B2 |
March 2, 2019, 1:41 p.m. |
OK |
Q# |
TESTS |
1 |
186 |
0 |
|
|
58337752 |
Sali_adelkhah |
B2 |
Aug. 5, 2019, 12:06 p.m. |
OK |
Q# |
TESTS |
1 |
218 |
0 |
|
|
51056031 |
yongwhan |
B2 |
March 8, 2019, 10:33 p.m. |
OK |
Q# |
TESTS |
1 |
218 |
0 |
|
|
50718266 |
dacin21 |
B2 |
March 3, 2019, 8:07 a.m. |
OK |
Q# |
TESTS |
1 |
218 |
0 |
|
|
50659709 |
eatmore |
B2 |
March 1, 2019, 9:56 p.m. |
OK |
Q# |
TESTS |
1 |
218 |
0 |
|
|
50808789 |
Xellos |
B2 |
March 5, 2019, 7:20 a.m. |
OK |
Q# |
TESTS |
1 |
249 |
0 |
|
|
59426778 |
tmwilliamlin168 |
B2 |
Aug. 25, 2019, 3:14 a.m. |
OK |
Q# |
TESTS |
1 |
249 |
3072000 |
|
|
50695050 |
vilim_l |
B2 |
March 2, 2019, 5:40 p.m. |
OK |
Q# |
TESTS |
1 |
264 |
0 |
|
|
remove filters
Back to search problems