Quantum neural network may bypass uncertainty principle

Researchers have mathematically shown that a quantum neural network could help measure hard-to-access properties of quantum objects, potentially cheating the Heisenberg uncertainty principle. By injecting randomness into the network, scientists might determine multiple incompatible properties more precisely. This approach could speed up applications in quantum computing and chemistry.

The Heisenberg uncertainty principle limits how precisely certain quantum properties, like position and momentum, can be measured simultaneously. For quantum objects such as molecules or qubits in quantum computers, this makes predictions and assessments challenging, as measurements can interfere with each other.

Duanlu Zhou at the Chinese Academy of Sciences and his colleagues have proved mathematically that a quantum neural network (QNN) could overcome these issues. Traditional operations on qubits are often incompatible due to the uncertainty principle, similar to performing conflicting calculations on a number. However, a QNN with randomly chosen steps from a set can resolve this incompatibility.

Previous work showed randomness helps QNNs measure single properties effectively. Zhou's team extended this to multiple properties, including those constrained by the uncertainty principle. By applying consecutive random operations and unraveling results with statistical methods, the approach yields more precise outcomes than repeated single operations.

This is particularly useful for quantum computers, where understanding qubit properties is essential for benchmarking devices or emulating molecules and materials. Robert Huang at the California Institute of Technology notes that efficiently measuring many incompatible properties would allow scientists to learn about quantum systems much faster, aiding applications in chemistry and materials science, as well as scaling up quantum computers.

The method seems plausible for practical implementation, though its success may hinge on outperforming other randomness-based quantum measurement techniques. The findings appear in Physical Review B (DOI: 10.1103/qz9c-m3z4).

관련 기사

A new analysis indicates that two key quantum computing algorithms for chemistry problems have limited practical use, even with advancing hardware. Researchers suggest that calculating molecular energy levels may not justify the technology's investment as hoped. This challenges the view of quantum chemistry as a major application for quantum computers.

AI에 의해 보고됨

Researchers at Google have demonstrated that quantum contextuality plays a key role in the power of quantum computers. Using their Willow quantum computer, the team implemented algorithms that highlight this quantum property's efficiency. The findings suggest a path toward quantum advantage over classical machines.

Researchers have developed algorithms called phantom codes to make quantum computers less error-prone, potentially allowing them to run complex simulations more efficiently. These codes enable entanglement of logical qubits without physical manipulations, cutting down on error risks. The approach shows promise for tasks requiring extensive entanglement, though it is not a complete solution to quantum computing challenges.

AI에 의해 보고됨

중국 연구원들이 양자 시스템에서 일시적인 안정 단계를 제어해 양자 카오스를 슬로우 모션으로 만들었으며, 이는 양자 정보를 보존할 수 있는 가능성을 제시한다. 이를 통해 과학자들은 양자 비간섭의 속도를 조절할 수 있으며, 복잡한 양자 환경을 관리하는 데 필수적인 도구를 제공한다.

 

 

 

이 웹사이트는 쿠키를 사용합니다

사이트를 개선하기 위해 분석을 위한 쿠키를 사용합니다. 자세한 내용은 개인정보 보호 정책을 읽으세요.
거부