Microsoft Q# Coding Contest - Winter 2019 - Warmup

Solutions for Microsoft Q# Coding Contest - Winter 2019 - Warmup (contest 1115). 6/6 problems verified against sample I/O. Difficulty range: 1100-1700.

6 items

Microsoft Q# Coding Contest - Winter 2019 - Warmup

Type: Special | Problems: 6 | Verified: 6/6 | Rating range: 1100-1700 | Time: 5m 11s

Problem	Name	Rating	Tags	Solve Time	Verified
G1	AND oracle	1100	*special	43s	✓
G2	OR oracle	1600	*special	54s	✓
G3	Palindrome checker oracle	1600	*special	52s	✓
U1	Anti-diagonal unitary	1500	*special	1m 6s	✓
U2	Chessboard unitary	1600	*special	46s	✓
U3	Block unitary	1700	*special	50s	✓

Practice › Codeforces Solutions › Microsoft Q# Coding Contest - Winter 2019 - Warmup ›

CF 1115U1 - Anti-diagonal unitary

We are asked to implement a quantum operation on an array of qubits. The operation must correspond to a unitary matrix whose only non-zero entries lie on the anti-diagonal. For a system of $N$ qubits, the state space has dimension $2^N$.

Practice › Codeforces Solutions › Microsoft Q# Coding Contest - Winter 2019 - Warmup ›

CF 1115U3 - Block unitary

We are asked to implement a quantum unitary operation on $N$ qubits, where $N$ is small, between 2 and 5. The operation is represented by a $2^N times 2^N$ matrix with a specific block structure. The matrix can be visualized as four quarters: 1.

Practice › Codeforces Solutions › Microsoft Q# Coding Contest - Winter 2019 - Warmup ›

CF 1115U2 - Chessboard unitary

We are asked to implement a unitary operation on $N$ qubits, where $2 le N le 5$. The operation is represented by a $2^N times 2^N$ matrix with a chessboard-like pattern of zeros and non-zero elements.

Practice › Codeforces Solutions › Microsoft Q# Coding Contest - Winter 2019 - Warmup ›

CF 1115G2 - OR oracle

We are given a small quantum register of at most eight qubits that encode an input bitstring $x0, x1, dots, x{N-1}$, along with one extra qubit $y$ that acts as an output wire.

Practice › Codeforces Solutions › Microsoft Q# Coding Contest - Winter 2019 - Warmup ›

CF 1115G3 - Palindrome checker oracle

We are asked to implement a quantum oracle acting on a small register of qubits. The oracle receives an input string encoded in quantum form, represented by an array of up to eight qubits, plus one additional qubit that serves as the output bit.

Practice › Codeforces Solutions › Microsoft Q# Coding Contest - Winter 2019 - Warmup ›

CF 1115G1 - AND oracle

We are asked to implement a quantum operation that computes the logical AND of an array of qubits. Concretely, we have a set of $N$ qubits, each representing a binary value (0 or 1, though they can be in superposition), and a single output qubit.