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