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 in state and an integer sign. Your task is to convert the given qubit to state if sign xe2 x80 x89= xe2 x80 x891 or if sign xe2 x80 x89= xe2 x80 x89 xe2 x80 x89- xe2 x80 x891. You have to implement an operation which takes a qubit and an integer as an input and has no output. The "output" of your solution is the state in which it left the input qubit. 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 |
39790579 |
rookie_nerd |
A |
June 30, 2018, 7:21 a.m. |
OK |
Q# |
TESTS |
2 |
170 |
0 |
|
2200 |
39856993 |
snuke |
A |
July 2, 2018, 4:47 a.m. |
OK |
Q# |
TESTS |
2 |
186 |
0 |
|
2200 |
39872600 |
savinovalex |
A |
July 2, 2018, 3:30 p.m. |
OK |
Q# |
TESTS |
2 |
187 |
0 |
|
2200 |
39845523 |
vadym_doroshenko |
A |
July 1, 2018, 5:21 p.m. |
OK |
Q# |
TESTS |
2 |
187 |
0 |
|
2200 |
39818347 |
Bogga_Vogga |
A |
July 1, 2018, 10:17 a.m. |
OK |
Q# |
TESTS |
2 |
187 |
0 |
|
2200 |
39871873 |
VArtem |
A |
July 2, 2018, 2:58 p.m. |
OK |
Q# |
TESTS |
2 |
202 |
0 |
|
2200 |
39871506 |
michael.dotsenko |
A |
July 2, 2018, 2:44 p.m. |
OK |
Q# |
TESTS |
2 |
202 |
0 |
|
2200 |
39867069 |
helThazar |
A |
July 2, 2018, 11:57 a.m. |
OK |
Q# |
TESTS |
2 |
202 |
0 |
|
2200 |
39857276 |
y0105w49 |
A |
July 2, 2018, 5:06 a.m. |
OK |
Q# |
TESTS |
2 |
202 |
0 |
|
2200 |
39854752 |
carrino |
A |
July 2, 2018, 2:10 a.m. |
OK |
Q# |
TESTS |
2 |
202 |
0 |
|
2200 |
remove filters
Back to search problems