Posted in | News | Quantum Computing

Researchers Propose Quantum Analogues of Classical Randomness Extractors for First Time

Stephanie Wehner from the Centre for Quantum Technologies together with Omar Fawzi from McGill University, Canada, and Mario Berta from ETH Zurich, Switzerland, have explored a new method to create randomness, hypothesizing quantum analogues of classical randomness extractors for the first time.

The findings have already helped in the advancement of the ‘noisy-storage model’ proposed by Stephanie to ensure security for tasks such as secure identification wherein two parties who do not have faith on each other want to jointly find a solution for a problem. The new research relates this model’s security to the quantum capacity.

Quantum randomness is one of the renowned aspects of quantum theory has been explored in several experiments since its introduction in the early 19th Century. Stephanie and collaborators believe that it is possible to perform some measurements on a closed system of quantum bits (qubits) to extort randomness without knowing the quantum system’s exact state. They also originate basic limits on the randomness gettable, which relies on the quantum entanglement of the observer with the system. The limits include the extraction of the optimal amount of randomness for a given initial randomness invested.

For real-world applications, Stephanie points out that the observer that do not entangle with the measurement device is essential to depend on for randomness instead of inadequate knowledge to be assumed in the case of classical system. For entanglement, the observer may need a quantum interplay with the measured quantum system and a quantum memory. They may able to estimate the random bits only if they break into the lab to create the entanglement prior to the measurements.

Stephanie is also believed that quantum to classical randomness extractors can provide support to new hypothetical insights. Classical randomness extractors are the core in classical theoretical computer science and are associated with ideas like complexity and error correcting codes.

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). Researchers Propose Quantum Analogues of Classical Randomness Extractors for First Time. AZoQuantum. Retrieved on November 21, 2024 from https://www.azoquantum.com/News.aspx?newsID=114.

  • MLA

    Soutter, Will. "Researchers Propose Quantum Analogues of Classical Randomness Extractors for First Time". AZoQuantum. 21 November 2024. <https://www.azoquantum.com/News.aspx?newsID=114>.

  • Chicago

    Soutter, Will. "Researchers Propose Quantum Analogues of Classical Randomness Extractors for First Time". AZoQuantum. https://www.azoquantum.com/News.aspx?newsID=114. (accessed November 21, 2024).

  • Harvard

    Soutter, Will. 2019. Researchers Propose Quantum Analogues of Classical Randomness Extractors for First Time. AZoQuantum, viewed 21 November 2024, https://www.azoquantum.com/News.aspx?newsID=114.

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.