Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Optimizing linear optics quantum gates.

J Eisert1

  • 1Blackett Laboratory, Imperial College London, UK.

Physical Review Letters
|August 11, 2005
PubMed
Summary
This summary is machine-generated.

This study links quantum gate optimization to convex optimization, establishing general upper bounds for linear optical quantum gate success probabilities. It proves the nonlinear sign shift gate

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Probing coherent quantum thermodynamics using a trapped ion.

Nature communications·2024
Same author

Shadow estimation of gate-set properties from random sequences.

Nature communications·2023
Same author

Quantum simulation of thermodynamics in an integrated quantum photonic processor.

Nature communications·2023
Same author

One T Gate Makes Distribution Learning Hard.

Physical review letters·2023
Same author

Efficient Unitary Designs with a System-Size Independent Number of Non-Clifford Gates.

Communications in mathematical physics·2023
Same author

Entangling Power and Quantum Circuit Complexity.

Physical review letters·2021
Same journal

Erratum: Bacterial Turbulence at Compressible Fluid Interfaces [Phys. Rev. Lett. 136, 138301 (2026)].

Physical review letters·2026
Same journal

Unveiling Light-Quark Yukawa Flavor Structure via Dihadron Fragmentation at Lepton Colliders.

Physical review letters·2026
Same journal

Adaptable Route to Fast Coherent State Transport via Bang-Bang-Bang Protocols.

Physical review letters·2026
Same journal

Topological Transition and Emergence of Elasticity of Dislocation in Skyrmion Lattice: Beyond Kittel's Magnetic-Polar Analogy.

Physical review letters·2026
Same journal

Pound-Drever-Hall Method for Superconducting-Qubit Readout.

Physical review letters·2026
Same journal

Coupling a ^{73}Ge Nuclear Spin to an Electrostatically Defined Quantum Dot in Silicon.

Physical review letters·2026
See all related articles

Area of Science:

  • Quantum Information Science
  • Quantum Computing
  • Quantum Optics

Background:

  • Linear optical quantum gates are crucial for quantum computation.
  • Determining optimal success probabilities for these gates is a complex challenge.
  • Previous work established conjectures for specific gates, like the nonlinear sign shift.

Purpose of the Study:

  • To establish a general method for deriving upper bounds on the success probabilities of linear optical quantum gates.
  • To prove the conjecture regarding the optimal success probability of the nonlinear sign shift gate.
  • To demonstrate the applicability of convex optimization and Lagrange duality to quantum gate design.

Main Methods:

  • Formulating the problem of optimal quantum gate success probabilities as a convex optimization problem.

Related Experiment Videos

  • Utilizing Lagrange duality to derive rigorous upper bounds.
  • Analyzing postselected networks of arbitrary size and photon numbers.

    • Main Results:

    • Established general upper bounds for the success probability of single-mode gates in postselected linear optical networks.
    • Proved that the optimal success probability for the nonlinear sign shift gate without feedforward is 1/4.
    • Demonstrated the effectiveness of convex optimization and Lagrange duality for rigorous bound proofs.

    Conclusions:

    • Convex optimization provides a powerful framework for analyzing and optimizing quantum gate performance.
    • The derived bounds are broadly applicable to various quantum network configurations.
    • This work validates key conjectures and advances the theoretical understanding of linear optical quantum computation.