The following languages are only available languages for the problems from the contest

Microsoft Q# Coding Contest - Summer 2018:

- Microsoft Q#

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A3. Generate superposition of two basis states

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given *N* qubits (1 ≤ *N* ≤ 8) in zero state . You are also given two bitstrings *bits*0 and *bits*1 which describe two different basis states on *N* qubits and .

Your task is to generate a state which is an equal superposition of the given basis states:

You have to implement an operation which takes the following inputs:

- an array of qubits
*qs*, - two arrays of Boolean values
*bits*0 and*bits*1 representing the basis states and . These arrays will have the same length as the array of qubits.*bits*0 and*bits*1 will differ in at least one position.

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:

namespace Solution {

open Microsoft.Quantum.Primitive;

open Microsoft.Quantum.Canon;

operation Solve (qs : Qubit[], bits0 : Bool[], bits1 : Bool[]) : ()

{

body

{

// your code here

}

}

}

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/26/2019 10:32:35 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|