Question 1 Quantum Simulator
In the programming language of your choice, design a quantum simulator. The simulator will take as input a file containing information about the number of qubit, the circuit, and inputs and will generate another file with the intermediate states as output. The input file will be formatted as follow:
N: The first line will contain the number of qubit that we want to simulate, followed by N
lines, all of the same length, describing each wire in the circuit.
Each wire in the circuit will consists of one of either of the these gates X,Y,Z,H or special symbols: o describing “control” for a controlled gate and “-” corresponds to no-operation. Control acts on all the gates that are in the same column as the control symbol.
M: The number of inputs to the simulator, followed by M lines, each containing N characters representing inputs. Inputs will be combination one of |0),|1),|+),|−)
Sample Input file:
2
-X-
-o- 5
00
01
10
11
++
which is a circuit on N = 2 qubits (the first line). The first wire (least significant) consists of -X- and the second -o-. Thus implementing a controlled-NOT gate where the second bit is the control bit. The next line contains the number of inputs (M = 5) followed by M N-bit strings representing the inputs that we want to run through the circuit.
The output file generated will contain:
For each input, the quantum state of size 2N after each step (one per line) in the circuit for which a valid operation has been applied to either of the qubits. We ignore the step on which all lines have a no-op (“-”). An empty line indicates that the current input has been completely processed.
Sample output file:
[1 |
0 |
0 |
0] |
[0 |
1 |
0 |
0] |
[0 |
0 |
0 |
1] |
[0 |
0 |
1 |
0] |
[0.5 0.5 0.5 0.5]
The output will contain M (S + 1) , where S is the number of valid steps in the circuit and there is a blank line to indicate the end of current output.
R Give details about your implementation and the assumptions that have been made while implementing the simulator. Also highlight any limitations that you think the simulator has.
C: Submit the code for the simulator, with the main file titled main.cpp (if for example your code is in C++). The executable should be able to take the input file as a command line argument and generate a file named out.txt containing the output.
Question 2 Creating EPR Pairs
Design a circuit to create an entangled EPR pair. This circuit takes as input |00) and produces
√1 (|00) + |11)).
R: Comment on what happens if the input is something different from 00 . Are the states still entangled by this circuit?
C: Submit the input file (txt) for this circuit along with your code.
Question 3 Dense Coding
Using your simulator, implement a circuit to perform dense coding described in Section. 5.3.1 of [RP]. The circuit takes 00 as input, creates an entangled pair (Question 1), and then performs encoding. The second part of the circuit decodes the incoming bits to extract two classical bits.
R: Discuss how critical is the choice of input to this circuit. Does the scheme fail is input changes to let’s say |11)?
C: Submit the circuit input file (question3.txt) simulates Alice’s encoding of the 10
state and the decoded result by Bob.Question 4 Cat state
An n-qubit cat state is the state
|00 . . . 0), constructs a cat state.
√1 (|00 . . . 0) + |11 . . . 1)). Design a circuit that, upon input of
R: Describe the circuit components needed to extend a n-qubit cat state to an n+1-qubit cat state.
C: Submit the input file (txt) for the circuit.
Question 5 Permutation
Design a circuit that permutes the values of three qubits in that it sends |φ) |ψ) |η) to |ψ) |η) |φ) for all single qubit states |φ) , |ψ) , and |η) in the standard basis.
R: Discuss how this circuit can be reused to implement a circuit that sends |φ) |ψ) |η)
DescriptionIn this final assignment, the students will demonstrate their ability to apply two majorconstructs of the C programming language – Fu
Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t
Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th
1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of
1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of