A) The storage of classical bits in hardware B) The evolution of macroscopic classical systems C) The mathematical proof of the uncertainty principle D) How microscopic physical systems change dynamically
A) As exclusively infinite-dimensional systems B) Abstracted away from real-world counterparts C) As identical to classical bit storage units D) Solely as simulations of harmonic oscillators
A) Density matrices over complex numbers B) Harmonic oscillator equations C) Classical binary string logic D) Probability distribution vectors of length n
A) An electron spin B) A large collection of atoms C) A trapped ion D) A photon
A) A large collection of atoms B) A single photon C) A solitary ion D) A harmonic oscillator
A) It rejects the use of complex numbers B) It concerns both continuous-variable and finite-dimensional systems C) It ignores continuous-variable systems entirely D) It only focuses on infinite-dimensional systems
A) Uncertainty in the state B) The number of bits used to store data C) The total energy D) The momentum of particles
A) Claude Shannon B) Albert Einstein C) Richard Feynman D) Max Planck
A) Having two states B) Having infinite dimensions C) Being a photon D) Being microscopic
A) Information gained after measurement B) Energy dissipated during measurement C) Information lost during measurement D) Physical work required to perform measurement
A) Uncertainty prior to measurement B) Energy of the discrete distribution C) Total classical bits available D) Linearity of the system
A) Kelvin B) Bits C) Joules D) Hertz
A) Natural logarithm (e) B) Base 8 C) Base 10 D) Base 2
A) When the entropy is zero B) When the system is microscopic C) When the number of samples is large D) When the system has only one state
A) The number of bits in a single sample B) Physical resources required to store output C) The temperature of the source D) The speed of data transmission
A) 1990s B) 1960s C) 1970s D) 1980s
A) Quantum effects causing interference as transistors got smaller B) The discovery of the Deutsch-Jozsa algorithm C) The need to disprove relativity D) The invention of the scanning tunneling microscope
A) Bit B) Quark C) Byte D) Qubit
A) Von Neumann entropy B) Planck's constant C) Boltzmann constant D) Shannon entropy
A) Cryptography B) Botany C) Astronomy D) Geology
A) 18th century B) 20th century C) 19th century D) 21st century
A) Ultraviolet catastrophe B) Wave-particle duality C) Quantum tunneling D) Photoelectric effect
A) Werner Heisenberg B) Carl Helstrom C) Erwin Schrödinger D) John von Neumann
A) Erwin Schrödinger B) Alexander Holevo C) Werner Heisenberg D) Ruslan Stratonovich
A) 1950s B) 1970s C) 1980s D) 1960s
A) Carl Helstrom B) Ruslan Stratonovich C) Von Neumann D) Alexander Holevo
A) Added ad hoc hypotheses B) Ignored physics entirely C) Discarded the nucleus model D) Adopted string theory
A) Ben Schumacher B) Leonard Susskind C) Max Planck D) Claude Shannon
A) Density matrix B) Hilbert space C) Bloch sphere D) Shannon circle
A) No-cloning theorem B) No-broadcast theorem C) No-teleportation theorem D) No-hiding theorem
A) No-cloning theorem B) No-teleportation theorem C) No-deleting theorem D) No-hiding theorem
A) Digital states B) Entropy C) Unitarity D) Classical bits
A) No-hiding theorem B) No-cloning theorem C) No-deleting theorem D) No-teleportation theorem
A) No-cloning theorem B) No-broadcast theorem C) No-teleportation theorem D) No-hiding theorem
A) No-deleting theorem B) No-hiding theorem C) No-cloning theorem D) No-broadcast theorem
A) Probabilistic B) Unitary C) Discrete D) Continuous
A) Projections B) Rotations C) Reflections D) Translations
A) Unitary B) Non-linear C) Hermitian D) Stochastic
A) P B) NP C) PSPACE D) BQP
A) Grover's algorithm B) Shor's algorithm C) Simon's algorithm D) Deutsch-Jozsa algorithm
A) Quadratic B) Linear C) Exponential D) Constant
A) Qubits per second B) Baud rate C) Hertz D) Bits per second
A) r approaches 0 B) r approaches 1 C) r approaches infinity D) r approaches 2
A) r approaches infinity B) r approaches 1 C) r approaches 0.5 D) r approaches 0
A) r approaches 1 B) r approaches 0 C) r approaches infinity D) r approaches 2
A) tr(rho log2 rho) B) -tr(rho log2 rho) C) -log2(tr(rho)) D) tr(log2 rho)
A) 1994 B) 1981 C) 1984 D) 1991
A) Eight B) Four C) Three D) Two
A) He gets the correct bit B) He gets the opposite bit C) He gets a random bit D) He will not measure anything
A) Gilles Brassard B) Charles Bennett C) Artur Ekert D) Alice
A) Use of ancilla qubits B) Perfect isolation of the system C) Interaction with the environment D) Measurement of a single 0 or 1 state
A) Quantum error correction B) Perfect isolation C) Constant measurement D) Interaction with the environment
A) Fault-tolerant computation B) The formulation of error codes C) The bit model D) Energy loss by friction
A) Peter Shor B) Richard Feynman C) Albert Einstein D) No specific researcher |