scientific article

zbMATH Open1183.81036MaRDI QIDQ3400469

Author name not available (Why is that?)

Publication date: 5 February 2010

Title of this publication is not available (Why is that?)

zbMATH Keywords

quantum computationcircuit complexityquantum complexityuniversal circuit

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (8)

Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact ⋮ Efficient and scalable universal circuits ⋮ More efficient universal circuit constructions ⋮ Quantum fully homomorphic encryption scheme based on universal quantum circuit ⋮ Title not available (Why is that?) ⋮ Universal Quantum Simulators ⋮ Fast universal quantum computation with railroad-switch local Hamiltonians ⋮ Efficient Algorithms for Universal Quantum Simulation

Recommendations

• Efficient and scalable universal circuits 👍 👎
• Universal quantum gates 👍 👎
• Efficient Algorithms for Universal Quantum Simulation 👍 👎
• Universal Quantum Simulators 👍 👎
• Efficient Universal Quantum Circuits 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400469)