Microsoft Q# Coding Contest - Summer 2018 - Warmup

9 problems from Microsoft Q# Coding Contest - Summer 2018 - Warmup (contest 1001), difficulty 1100-1700. 9/9 solutions verified against sample I/O.

9 items

Microsoft Q# Coding Contest - Summer 2018 - Warmup

Special | 9 problems | 9/9 verified | Difficulty 1100-1700 | 12m 5s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Generate plus state or minus state	1100	*special	1,040	58s	✓
B	Generate Bell state	1400	*special	721	1m 2s	✓
C	Generate GHZ state	1400	*special	666	2m 48s	✓
D	Distinguish plus state and minus state	1400	*special	697	57s	✓
E	Distinguish Bell states	1600	*special	568	52s	✓
F	Distinguish multi-qubit basis states	1300	*special	550	53s	✓
G	Oracle for f(x) = k-th element of x	1400	*special	552	58s	✓
H	Oracle for f(x) = parity of the number of 1s in x	1200	*special	546	47s	✓
I	Deutsch-Jozsa algorithm	1700	*special	413	2m 50s	✓

Practice › Codeforces Solutions › Microsoft Q# Coding Contest - Summer 2018 - Warmup ›

CF 1001I - Deutsch-Jozsa algorithm

We are given access to a black-box quantum oracle that encodes a boolean function over all $2^N$ binary inputs of length $N$. For any input bitstring $x$, the oracle evaluates $f(x)$ without revealing the function explicitly.

Practice › Codeforces Solutions › Microsoft Q# Coding Contest - Summer 2018 - Warmup ›

CF 1001H - Oracle for f(x) = parity of the number of 1s in x

We are given a register of qubits representing an integer in binary form, along with an additional qubit that acts as a target bit.

Practice › Codeforces Solutions › Microsoft Q# Coding Contest - Summer 2018 - Warmup ›

CF 1001G - Oracle for f(x) = k-th element of x

We are given a very small quantum program interface: an array of qubits x, a single qubit y, and an index k. The task is to implement a reversible transformation that encodes a classical function into a quantum oracle. The function itself is extremely simple.

Practice › Codeforces Solutions › Microsoft Q# Coding Contest - Summer 2018 - Warmup ›

CF 1001C - Generate GHZ state

We are given a small register of up to eight qubits, all initially prepared in the all-zero computational basis state.

Practice › Codeforces Solutions › Microsoft Q# Coding Contest - Summer 2018 - Warmup ›

CF 1001F - Distinguish multi-qubit basis states

We are given an array of qubits, but the important promise is simpler than the quantum framing suggests: the system is guaranteed to be in one of two classical computational basis states.

Practice › Codeforces Solutions › Microsoft Q# Coding Contest - Summer 2018 - Warmup ›

CF 1001D - Distinguish plus state and minus state

We are given a single qubit that has been prepared in one of two possible states. These two states are not computational basis states like The task is to interact with this qubit using allowed quantum operations, perform a measurement, and return an integer that identifies…

Practice › Codeforces Solutions › Microsoft Q# Coding Contest - Summer 2018 - Warmup ›

CF 1001E - Distinguish Bell states

We are given a pair of qubits that were prepared in one of four specific two-qubit entangled states. These four states form the Bell basis, meaning they are maximally entangled and differ only by relative phase and bit flips, not by local classical information on each qubit.

Practice › Codeforces Solutions › Microsoft Q# Coding Contest - Summer 2018 - Warmup ›

CF 1001B - Generate Bell state

We are working in a quantum setting with two qubits that initially form the computational basis state corresponding to both being zero. The task is to transform these two qubits in-place into one of four specific entangled states, chosen by an integer index from 0 to 3.

Practice › Codeforces Solutions › Microsoft Q# Coding Contest - Summer 2018 - Warmup ›

CF 1001A - Generate plus state or minus state

We are working in a quantum programming setting where a single qubit is already in a known initial basis state, and we are asked to transform it into one of two target basis states depending on the value of an integer parameter called sign.