New Technique Reliably Assesses Information on Quantum Computing and Cryptography

A research team comprising Filippo Miatto and other physicists from the University of Strathclyde, Glasgow, UK, has discovered a new technique to reliably evaluate the information carried by photon pairs utilized for quantum computing and cryptography applications.

The study results have been reported in European Physical Journal D. With these results, the information in the photon pairs can be accessed even if the measurements on them are defective. The researchers concentrated on photon pairs that are in a quantum entanglement state, specifically composed of several superimposed pairs of states. Thus, these photon pairs are closely connected by general physical properties such as orbital angular momentum, a spatial property that is capable of demonstrating different values for every superimposed state.

The researchers depended on a tool that can decompose the superimposed states of the photon pairs onto the various dimensions of a Hilbert space, a virtual space defined by mathematical equations. By this approach, they were able to understand the degree of entanglement of the photon pairs.

The research team demonstrated that the degree of accessibility of the information carried by the photon pairs is more when the degree of entanglement is higher. Thus, creating entangled photon pairs with a higher dimension, i.e., with an adequate amount of decomposed photon states that are measurable may be helpful in revealing their information with greater certainty.

This means that even a defective measurement of physical properties of photons does not impact the quantity of information that can be obtained if the degree of entanglement was originally robust. These results pave the way to quantum information applications with better error resilience and a greater information density coding per photon pair. They also enable cryptography applications where a less number of photons carry more information regarding complex quantum encryption keys.

Will Soutter

Written by

Will Soutter

Will has a B.Sc. in Chemistry from the University of Durham, and a M.Sc. in Green Chemistry from the University of York. Naturally, Will is our resident Chemistry expert but, a love of science and the internet makes Will the all-rounder of the team. In his spare time Will likes to play the drums, cook and brew cider.

Citations

Please use one of the following formats to cite this article in your essay, paper or report:

  • APA

    Soutter, Will. (2019, February 18). New Technique Reliably Assesses Information on Quantum Computing and Cryptography. AZoQuantum. Retrieved on July 19, 2024 from https://www.azoquantum.com/News.aspx?newsID=68.

  • MLA

    Soutter, Will. "New Technique Reliably Assesses Information on Quantum Computing and Cryptography". AZoQuantum. 19 July 2024. <https://www.azoquantum.com/News.aspx?newsID=68>.

  • Chicago

    Soutter, Will. "New Technique Reliably Assesses Information on Quantum Computing and Cryptography". AZoQuantum. https://www.azoquantum.com/News.aspx?newsID=68. (accessed July 19, 2024).

  • Harvard

    Soutter, Will. 2019. New Technique Reliably Assesses Information on Quantum Computing and Cryptography. AZoQuantum, viewed 19 July 2024, https://www.azoquantum.com/News.aspx?newsID=68.

Tell Us What You Think

Do you have a review, update or anything you would like to add to this news story?

Leave your feedback
Your comment type
Submit

While we only use edited and approved content for Azthena answers, it may on occasions provide incorrect responses. Please confirm any data provided with the related suppliers or authors. We do not provide medical advice, if you search for medical information you must always consult a medical professional before acting on any information provided.

Your questions, but not your email details will be shared with OpenAI and retained for 30 days in accordance with their privacy principles.

Please do not ask questions that use sensitive or confidential information.

Read the full Terms & Conditions.