Researcher:
Bacınoğlu, Tan

Profile Picture
ORCID

Job Title

Other

First Name

Tan

Last Name

Bacınoğlu

Name

Name Variants

Bacınoğlu, Tan
Bacınoğlu, Baran Tan

Email Address

Birth Date

Filters

20102

Advanced Search

Filter by

Settings

Researcher Of Publications: search.filters.isAuthorOfPublication.fbd8b406-8cae-4282-aee7-54b75aaa9216

Search Results

Now showing 1 - 2 of 2
  • Placeholder
    PublicationMetadata only
    Constant fidelity entanglement flow in quantum communication networks
    (Ieee, 2010) Department of Electrical and Electronics Engineering; N/A; Department of Electrical and Electronics Engineering; Bacınoğlu, Tan; Gülbahar, Burhan; Akan, Özgür Barış; N/A; PhD Student; Faculty Member; Department of Electrical and Electronics Engineering; College of Engineering; Graduate School of Sciences and Engineering; College of Engineering; N/A; 234525; 6647
    Entanglement distribution over long distances is one of the main problems in the existing quantum communication networks. Most of the existing methods of establishing entanglement paired link (Einstein, Podolsky, Rosen - EPR pairs) between distant nodes assume symmetric network topologies comprised of links with identical EPR generation capacities. In this work, the entanglement rate capacity of randomly distributed quantum ad hoc networks is investigated. To this end, constant fidelity maximum flow (CFMF) of entanglement problem is defined, and its theoretical analysis is presented. A new heuristic algorithm, i.e., Entanglement Swapping Scheme Search (ESSS), is presented to find the best possible swapping scheme over a multi-hop entanglement path. Furthermore, Shortest Path Entanglement Flow (SPEF) algorithm is introduced as an effective heuristic solution for this problem. Analysis shows that there is a trade-off between the desired constant target fidelity and the entanglement generation rate (maximum flow) of the network.
  • Thumbnail Image
    PublicationOpen Access
    Constant fidelity entanglement flow in quantum communication networks
    (Institute of Electrical and Electronics Engineers (IEEE), 2010) Bacınoğlu, Tan; Gülbahar, Burhan; Akan, Özgür Barış; Faculty Member; College of Engineering
    Entanglement distribution over long distances is one of the main problems in the existing quantum communication networks. Most of the existing methods of establishing entanglement paired link (Einstein, Podolsky, Rosen - EPR pairs) between distant nodes assume symmetric network topologies comprised of links with identical EPR generation capacities. In this work, the entanglement rate capacity of randomly distributed quantum ad hoc networks is investigated. To this end, constant fidelity maximum flow (CFMF) of entanglement problem is defined, and its theoretical analysis is presented. A new heuristic algorithm, i.e., Entanglement Swapping Scheme Search (ESSS), is presented to find the best possible swapping scheme over a multi-hop entanglement path. Furthermore, Shortest Path Entanglement Flow (SPEF) algorithm is introduced as an effective heuristic solution for this problem. Analysis shows that there is a trade-off between the desired constant target fidelity and the entanglement generation rate (maximum flow) of the network.