Efficient quantum computing between remote qubits in linear nearest neighbor architectures

DOI10.1007/S11128-012-0485-5zbMATH Open1267.81115OpenAlexW2013916073MaRDI QIDQ353000FDOQ353000

Preethika Kumar

Publication date: 5 July 2013

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-012-0485-5

zbMATH Keywords

quantumquantum costcontrolled-NOTgate countgateslinear nearest neighbornext-to-nearest-neighborremote qubitsuniversal

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Title not available (Why is that?)
• Synthesis of quantum circuits for linear nearest neighbor architectures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Optimal Quantum Circuits for Nearest-Neighbor Architectures
• Designing lattice structures with maximal nearest-neighbor entanglement
• Implementing gate operations between uncoupled qubits in linear nearest neighbor arrays using a learning algorithm
• Towards a multi target quantum computational logic
• A matrix representation of quantum circuits over non-adjacent qudits
• Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective

This page was built for publication: Efficient quantum computing between remote qubits in linear nearest neighbor architectures

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