Все публикации

#52/100: Reflecting through a vector || Quantum Computer Programming in 100 Easy Lessons

#51/100: The Elitzur-Vaidman Glitter Bomb || Quantum Computer Programming in 100 Easy Lessons

#50/100: Discriminating two rotations || Quantum Computer Programming in 100 Easy Lessons

#49/100: The No-Distinguishing Principle || Quantum Computer Programming in 100 Easy Lessons

#48/100: |v⟩ and −|v⟩ are indistinguishable || Quantum Computer Programming in 100 Easy Lessons

#47/100: Discriminating 2 qubits: optimal error || Quantum Computer Programming in 100 Easy Lessons

#46/100: Discriminating 2 qubits, multiple copies | Quantum Computer Programming in 100 Easy Lessons

#45/100: Discriminating 2 qubits, 2-sided error || Quantum Computer Programming in 100 Easy Lessons

#44/100: Discriminating 2 qubits, no false pos's || Quantum Computer Programming in 100 Easy Lessons

#43/100: Fun with filters || Quantum Computer Programming in 100 Easy Lessons

#42/100: Measuring in a different basis || Quantum Computer Programming in 100 Easy Lessons

#41/100: Dot products || Quantum Computer Programming in 100 Easy Lessons

#40/100: Angles & rotation matrices || Quantum Computer Programming in 100 Easy Lessons

#39/100: From North Pole to Gabon to Singapore || Quantum Computer Programming in 100 Easy Lessons

#38/100: Every rotation is 2-D rotations || Quantum Computer Programming in 100 Easy Lessons

#37/100: Rotations in 2-D || Quantum Computer Programming in 100 Easy Lessons

#36/100: Toggle and Hadamard are reflections || Quantum Computer Programming in 100 Easy Lessons

#35/100: Kets || Quantum Computer Programming in 100 Easy Lessons

#34/100: Summarizing all quantum algorithms || Quantum Computer Programming in 100 Easy Lessons

#32/100: Correlation of Boolean functions || Quantum Computer Programming in 100 Easy Lessons

#31/100: Bitmasked XOR functions || Quantum Computer Programming in 100 Easy Lessons

#29/100: Quantum Bias-Busting (Deutsch--Jozsa) || Quantum Computer Programming in 100 Easy Lessons

#27/100: Loading ±1 truth tables into the state || Quantum Computer Programming in 100 Easy Lessons

#26/100: Programming 'If f then Minus' || Quantum Computer Programming in 100 Easy Lessons

welcome to shbcf.ru