Skip to main content Accessibility help
×
  1. Home
  2. Publications
  3. Textbooks
  4. Content Listing

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

37953 results in Cambridge Textbooks

Page 79 of 1898

  • 19 - Optimality Conditions in Convex Programming

  • from Part IV - Convex Programming, Lagrange Duality, Saddle Points
  • Fatma Kılınç-Karzan, Carnegie Mellon University, Pennsylvania, Arkadi Nemirovski, Georgia Institute of Technology
  • Book:
    Essential Mathematics for Convex Optimization
    Published online:
    22 October 2025
    Print publication:
    26 June 2025, pp 264-276

  • Summary

    In this chapter we present convex programming optimality conditions in both sadde point form and Karush--Kuhn--Tucker form for mathematical programming, and also optimality conditions for cone-constrained convex programs and for conic problems. We conclude the chapter by revisiting linear programming duality as a special case of conic duality and reproducing the classical results on the dual of a linearly constrained convex quadratic minimization problem.

  • 2 - Quantum Mechanics for Quantum Computers

  • Asma Al-Qasimi, University of Rochester, New York, Daniel F. V. James, University of Toronto
  • Book:
    Quantum Information
    Published online:
    17 October 2025
    Print publication:
    26 June 2025, pp 18-50

  • Summary

    Using linear algebra, the mathematical techniques needed for describing and manipulating qubits are laid out in detail, including quantum circuits. Moreover, the chapter also explains the state evolution of an isolated quantum system, as is predicted by the Schrödinger equation, as well as non-unitary irreversible operations such as measurement. More details of classical and quantum randomness and their mathematical representation is discussed, leading to the density matrix. representation of a quantum state.

  • 4 - Quantum Algorithms

  • Asma Al-Qasimi, University of Rochester, New York, Daniel F. V. James, University of Toronto
  • Book:
    Quantum Information
    Published online:
    17 October 2025
    Print publication:
    26 June 2025, pp 78-100

  • Summary

    This is the chapter that gets down to applying concepts from the previous chapters about qubits to construct a quantum computer. It teaches how numbers can be stored in quantum computers and how their functions can be evaluated. It also demonstrates the computational speed-up that quantum computers offer over their classical counterparts through the study of Deutsch, Deutsch-Jozsa, and Bernstein-Vazirani algorithms. Finally, it gives a practical demonstration of speed-up in search algorithms provided by Grover’s search algorithm.

  • 3 - Two Qubits and Entanglement

  • Asma Al-Qasimi, University of Rochester, New York, Daniel F. V. James, University of Toronto
  • Book:
    Quantum Information
    Published online:
    17 October 2025
    Print publication:
    26 June 2025, pp 51-77

  • Summary

    Quantum entanglement requires a minimum of two quantum systems to exist, and each quantum system has to have a minimum of two levels. This is exactly what a two-qubit system is, which in this chapter is explored on various levels: state description, entanglement measures, useful theorems, quantum gates, hidden variable theory, quantum teleportation.

Page 79 of 1898