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'Implement a quantum oracle on N qubits which checks whether the vector vec{x} is a palindrome (i.e., implements the function f( vec{x}) = 1 if vec{x} is a palindrome, and 0 otherwise). You have to implement an operation which takes the following inputs: and performs a transformation |x rangle|y rangle rightarrow |x rangle|y oplus f(x) rangle . The operation doesn 't have an output; its "output" 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 |
50497112 |
WJT |
G3 |
Feb. 25, 2019, 3:37 p.m. |
OK |
Q# |
TESTS |
8 |
514 |
101171200 |
|
2200 |
50407370 |
ac517 |
G3 |
Feb. 23, 2019, 9:59 p.m. |
OK |
Q# |
TESTS |
8 |
514 |
101171200 |
|
2200 |
50342937 |
sevenkplus |
G3 |
Feb. 23, 2019, 4:11 a.m. |
OK |
Q# |
TESTS |
8 |
514 |
101171200 |
|
2200 |
50331980 |
Golovanov399 |
G3 |
Feb. 22, 2019, 6:57 p.m. |
OK |
Q# |
TESTS |
8 |
514 |
101171200 |
|
2200 |
50331221 |
DandanUA |
G3 |
Feb. 22, 2019, 6:37 p.m. |
OK |
Q# |
TESTS |
8 |
514 |
101171200 |
|
2200 |
50337100 |
googlweknoall |
G3 |
Feb. 22, 2019, 9:58 p.m. |
OK |
Q# |
TESTS |
8 |
514 |
101273600 |
|
2200 |
50415772 |
mhss |
G3 |
Feb. 24, 2019, 6:27 a.m. |
OK |
Q# |
TESTS |
8 |
529 |
101171200 |
|
2200 |
50406458 |
ollpu |
G3 |
Feb. 23, 2019, 9:08 p.m. |
OK |
Q# |
TESTS |
8 |
529 |
101171200 |
|
2200 |
50616143 |
quuu |
G3 |
Feb. 28, 2019, 7:43 p.m. |
OK |
Q# |
TESTS |
8 |
530 |
101171200 |
|
2200 |
50411206 |
Tarkan |
G3 |
Feb. 24, 2019, 2:46 a.m. |
OK |
Q# |
TESTS |
8 |
530 |
101171200 |
|
2200 |
remove filters
Back to search problems