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