Quantum computer
A quantum computer is a computing device that processes information using quantum-mechanical states and operations.
Real-World Cryptography
A quantum computer is a computing device that processes information using physical phenomena described by quantum mechanics.
- How it is used
- Frames quantum computers as emerging computational platforms and as a threat model motivating post-quantum cryptography.
- How deep it goes
- Explains qubits, superposition, gates, entanglement, measurement, algorithms, milestones, and scalability limits without implementation detail.
- Examples
- Uses electron spin, Schrödinger’s cat, quantum random number generators, and Google’s 53-qubit quantum-supremacy experiment.
- What you can do after
- Evaluate quantum computing’s cryptographic significance while separating demonstrated milestones from claims about scalable machines.
Read how Real-World Cryptography explains quantum computer →
Quantum Programming in Depth
Quantum hardware is physical computing equipment that stores and manipulates information in quantum states.
- How it is used
- Positions hardware as the execution target for algorithms and quantum application software, especially during validation.
- How deep it goes
- Explains NISQ limitations, hardware approaches, maturity milestones, and device-constrained testing without detailing physical implementations.
- Examples
- Uses quantum-system simulation, molecular-property evaluation, and early Deutsch, Deutsch-Jozsa, and Grover implementations as examples.
- What you can do after
- Evaluate/understand whether a workload and implementation fit current hardware limits rather than assuming quantum advantage.
Read how Quantum Programming in Depth explains quantum computer →
Building Quantum Software with Python
A quantum computer, or quantum computing system, is a machine that processes information using quantum-mechanical states and operations.
- How it is used
- Guides developers toward specialized computational problems where quantum methods may outperform classical approaches.
- How deep it goes
- Explains qubits, probabilities, measurement, parallelism, and amplitudes while deferring physical hardware and complex mathematical models.
- Examples
- Uses Fourier transforms, outcome–probability pairs, a variable-bias coin, and repeated measurements to illustrate quantum computation.
- What you can do after
- Evaluate candidate problems, understand quantum limitations, and prepare hybrid quantum–classical applications before large-scale hardware is available.
Read how Building Quantum Software with Python explains quantum computer →
Related concepts
- quantum superpositionuses · Quantum superposition is a quantum state that coherently combines multiple basis states with associated probability amplitudes.
- RSAcontrasts with · RSA is a public-key cryptosystem based on the computational difficulty of factoring large composite integers and supporting encryption and digital signatures.
- Grover's algorithmuses · Grover's algorithm is a quantum search algorithm that finds a marked item in an unstructured search space with a quadratic speedup over classical exhaustive search.
- public key cryptographycontrasts with · Public-key cryptography is asymmetric cryptography that uses mathematically related public and private keys for encryption, decryption, signing, and verification.
- algorithmhas part · An algorithm is a finite, precisely specified procedure for performing a computation, transforming inputs into outputs, or solving a problem.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.