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 N qubits (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89N xe2 x80 x89 xe2 x89 xa4 xe2 x80 x898) in zero state . Your task is to create Greenberger xe2 x80 x93Horne xe2 x80 x93Zeilinger (GHZ) state on them: Note that for N xe2 x80 x89= xe2 x80 x891 and N xe2 x80 x89= xe2 x80 x892 GHZ state becomes states and from the previous tasks, respectively. You have to implement an operation which takes an array of N qubits as an input and has no output. The "output" of your solution is the state in which it left the input 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 |
39815591 |
bmerry |
C |
July 1, 2018, 8:08 a.m. |
OK |
Q# |
TESTS |
8 |
218 |
0 |
|
2300 |
39808084 |
nasadigital |
C |
June 30, 2018, 9:40 p.m. |
OK |
Q# |
TESTS |
8 |
218 |
0 |
|
2300 |
39803289 |
beroul |
C |
June 30, 2018, 5:04 p.m. |
OK |
Q# |
TESTS |
8 |
218 |
0 |
|
2300 |
39778922 |
MiFaFaOvO |
C |
June 29, 2018, 6:52 p.m. |
OK |
Q# |
TESTS |
8 |
218 |
0 |
|
2300 |
39872682 |
tourist |
C |
July 2, 2018, 3:34 p.m. |
OK |
Q# |
TESTS |
8 |
233 |
0 |
|
2300 |
39871926 |
sahmosavian |
C |
July 2, 2018, 3 p.m. |
OK |
Q# |
TESTS |
8 |
233 |
0 |
|
2300 |
39868804 |
mareksom |
C |
July 2, 2018, 1 p.m. |
OK |
Q# |
TESTS |
8 |
233 |
0 |
|
2300 |
39856435 |
cosmopal |
C |
July 2, 2018, 4:04 a.m. |
OK |
Q# |
TESTS |
8 |
233 |
0 |
|
2300 |
39855437 |
carrino |
C |
July 2, 2018, 2:56 a.m. |
OK |
Q# |
TESTS |
8 |
233 |
0 |
|
2300 |
39849078 |
JeffreyLC |
C |
July 1, 2018, 7:06 p.m. |
OK |
Q# |
TESTS |
8 |
233 |
0 |
|
2300 |
remove filters
Back to search problems