COMS 4281 Problem Set 5 COMS 4281 – Intro to Quantum Computing Problem Set 5: Noise and Codes Due: December 11, 11�59pm. Collaboration is allowed and encouraged (teams of at most 3). Please read the syllabus carefully for the guidlines regarding collaboration. In particular, everyone must write their own solutions in their own words. Write […]
COMS 4281 Problem Set 5 Read More »
COMS 4281 Intro to Quantum Computing Problem Set 5 Qubit Tug-of-War Due date: December 18, 11�59pm. For the second part of Problem Set 5, you should get into teams of at most 3 (this will be strictly enforced), and as a team you will come up with strategies for a quantum video game we call
COMS 4281 Intro to Quantum Computing Problem Set 5 Qubit Tug-of-War Read More »
COMS 4281 Problem Set 4 COMS 4281 – Intro to Quantum Computing Problem Set 4: Hamiltonians, Algorithms, and Complexity Due: November 20, 11�59pm. Collaboration is allowed and encouraged (teams of at most 3). Please read the syllabus carefully for the guidlines regarding collaboration. In particular, everyone must write their own solutions in their own words.
COMS 4281 Problem Set 4 Read More »
9/13/22, 7:42 AM pset1 localhost:8888/nbconvert/html/pset1.ipynb?download=false 1/10 COMS 4281 – Intro to Quantum Computing Problem Set 1, Quantum Info Basics Due: September 23, 11�59pm Collaboration is allowed and encouraged (teams of at most 3). Please read the syllabus carefully for the guidlines regarding collaboration. In particular, everyone must write their own solutions in their own words.
COMS 4281 – Intro to Quantum Computing Read More »
COMS 4281 Problem Set 3 Quantum Algorithms COMS 4281 – Intro to Quantum Computing Problem Set 3, Quantum Algorithms Due: November 2, 11�59pm. Collaboration is allowed and encouraged (teams of at most 3). Please read the syllabus carefully for the guidlines regarding collaboration. In particular, everyone must write their own solutions in their own words.
COMS 4281 Problem Set 3 Quantum Algorithms Read More »
Quantum Computing Foundations to Frontier Quantum Computing: Foundations to Frontier Fall 2018 Lecturer: Henry Yuen Scribes: Deeksha Adil, Xing Hu, Jinhui Li, Fengwei Sun 1 Overview In the last lecture we were looking at Simon’s algorithm. In this lecture we complete the analysis of Simon’s algorithm and move on to Quantum Fourier Transform and its
CS 238 Homework Jens Palsberg January 2022 Catalog of matrices cos (θ/2) −i sin (θ/2) −i sin (θ/2) cos (θ/2) cos (θ/2) − sin (θ/2) sin (θ/2) cos (θ/2) where θ, φ ∈ R. Individual homework Unitary matrices Question 1. Prove that all the matrices in the catalog above are unitary. Question 2. Show that
CS 238 Quantum Homework Read More »
CS 239 Quantum Programming Spring 2019 Midterm Exam May 1, 2019: 100 minutes. Write your name and UCLA id on the first page you submit; staple the pages you submit. Each of questions 1–10 is worth 7 points, and each of questions 11-13 is worth 10 points. 1. Describe briefly the four postulates about quantum
CS 239 Quantum Programming Midterm Exam Read More »
MULT20015 Assignment 1 MULT20015 Elements of Quantum Computing Assignment 1 Due: 5pm, 20th August 2021 Instructions: Work on your own, attempt all questions. Submit your completed written work electronically as a pdf (no other formats accepted) to LMS, with name and student number on the front, on or before the due date. Please show all
MULT20015 Assignment 1 2021 LMS Read More »
MULT20015 Assignment 2 2021 final MULT20015 Elements of Quantum Computing Instructions: Work on your own, attempt all questions. Submit your completed written work electronically as a pdf file (no other formats accepted) to LMS, with name and student number on the front, on or before the due date. You may submit a scanned or photographed
MULT20015 Assignment 2 2021 LMS Read More »