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 quantum oracle - an operation on N xe2 x80 x89+ xe2 x80 x891 qubits which implements a function . You are guaranteed that the function f implemented by the oracle is scalar product function (oracle from problem D1): Here (an array of N integers, each of which can be 0 or 1). Your task is to reconstruct the array . Your code is allowed to call the given oracle only once. You have to implement an operation which takes the following inputs: The return of your operation is an array of integers of length N, each of them 0 or 1. 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 |
40046522 |
mxu |
E1 |
July 6, 2018, 11:24 p.m. |
OK |
Q# |
TESTS |
50 |
280 |
0 |
|
2100 |
40045430 |
shay.tzabari |
E1 |
July 6, 2018, 9:56 p.m. |
OK |
Q# |
TESTS |
50 |
280 |
0 |
|
2100 |
40044338 |
vitruvius |
E1 |
July 6, 2018, 8:57 p.m. |
OK |
Q# |
TESTS |
50 |
280 |
0 |
|
2100 |
40117001 |
kazuki_matsuda |
E1 |
July 9, 2018, 3:19 p.m. |
OK |
Q# |
TESTS |
50 |
295 |
0 |
|
2100 |
40040142 |
LucasS |
E1 |
July 6, 2018, 6:06 p.m. |
OK |
Q# |
TESTS |
50 |
295 |
0 |
|
2100 |
40054037 |
JizhouUSTC |
E1 |
July 7, 2018, 7:30 a.m. |
OK |
Q# |
TESTS |
50 |
296 |
0 |
|
2100 |
40051307 |
sergovoy |
E1 |
July 7, 2018, 4:57 a.m. |
OK |
Q# |
TESTS |
50 |
296 |
0 |
|
2100 |
40045562 |
eax255 |
E1 |
July 6, 2018, 10:06 p.m. |
OK |
Q# |
TESTS |
50 |
296 |
0 |
|
2100 |
40045026 |
guretat |
E1 |
July 6, 2018, 9:32 p.m. |
OK |
Q# |
TESTS |
50 |
296 |
0 |
|
2100 |
40044333 |
sazas |
E1 |
July 6, 2018, 8:56 p.m. |
OK |
Q# |
TESTS |
50 |
296 |
0 |
|
2100 |
remove filters
Back to search problems