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