Search results
Jump to navigation
Jump to search
Page title matches
- ...=Kong |first=Liang |title=An invitation to topological orders and category theory |date=2022-05-31 |url=https://arxiv.org/abs/2205.05565 |access-date=2025-03 == The algebraic theory of (2+1)D bosonic topological order == ...7 KB (991 words) - 19:29, 2 March 2025
Page text matches
- ...outputs exactly what was put in.<ref>{{citation|title=Quantum Information Theory|first=Mark|last=Wilde|publisher=Cambridge University Press|year=2013|isbn=9 [[Category:Information theory]] ...654 bytes (86 words) - 05:27, 13 March 2024
- '''Bennett's laws''' of [[quantum information]] are: # 1 qubit <math>\geqslant</math> 1 [[Bell state|ebit]] ([[quantum entanglement|entanglement]] bit), ...835 bytes (98 words) - 06:06, 17 June 2024
- ...ing information using an amount of entanglement given by the [[conditional quantum entropy]], <math>H(A|B)\,=\,H(AB)-H(B) \, .</math> with <math>H(A)</math> t ...this amount of entanglement can be gained, rather than used. Thus quantum information can be negative. ...3 KB (424 words) - 16:42, 12 May 2022
- '''Nielsen's theorem''' is a result in quantum information concerning transformations between bipartite states due to [[Michael Nielse [[Category:Quantum information theory]] ...1 KB (161 words) - 13:51, 5 January 2024
- {{Short description|Concept in quantum information science}} ...|last1=Chitambar|first1=Eric|last2=Gour|first2=Gilad|date=2019-04-04|title=Quantum resource theories|journal=[[Reviews of Modern Physics]]|volume=91|issue=2|p ...3 KB (451 words) - 22:44, 21 December 2024
- {{short description|Term in quantum information theory}} ...ole is analogous to that of the [[typical set]] in classical [[information theory]]. ...6 KB (913 words) - 01:33, 15 May 2021
- ...oning theorem]]), making it impossible to forge quantum money by including quantum systems in its design. ...uenced the development of [[quantum key distribution]] protocols used in [[quantum cryptography]]. ...4 KB (560 words) - 00:49, 21 March 2024
- ...lish|date=January 2019}}{{Short description|Theorem of quantum information theory}} ...imperfection in the physical process that seemingly destroys the original information. ...6 KB (975 words) - 14:01, 9 December 2024
- ...useful in considering measures of [[Quantum entanglement|entanglement]] of quantum states. [[Category:Quantum information theory]] ...2 KB (342 words) - 21:15, 5 June 2024
- ...complexity have led to the quantum version of the [[Cook–Levin theorem]]. Quantum Hamiltonian complexity has helped physicists understand the difficulty of s ...undary length of the area.<ref>{{Cite book|title=Quantum Information Meets Quantum Matter|last1=Zeng |first1=Bei|author1-link=Bei Zeng|last2=Xie|first2=Chen | ...3 KB (461 words) - 00:12, 29 December 2024
- {{Short description|Theorem pertaining to the ontology of quantum mechanics}} ...has particular significance for how one may interpret the nature of the [[quantum state]]. ...6 KB (742 words) - 17:38, 9 May 2024
- ...ish|date=January 2019}}{{Short description|Foundational theorem of quantum information processing}} ...tle=Common Origin of No-Cloning and No-Deleting Principles Conservation of Information |url=https://doi.org/10.1007/s10701-005-8661-4 |journal=Foundations of Phys ...8 KB (1,290 words) - 03:51, 30 November 2024
- ...bound]]. It bounds the achievable precision in parameter estimation with a quantum system: ...=G.J. |authorlink2=Carlton Caves |title=Generalized Uncertainty Relations: Theory, Examples, and Lorentz Invariance |journal=Annals of Physics |date=April 19 ...4 KB (616 words) - 19:54, 9 December 2023
- {{Short description|Quantum states of two qubits}} {{Quantum mechanics}} ...4 KB (537 words) - 19:13, 4 October 2024
- ...quantity in [[quantum metrology]], and is related to the [[quantum Fisher information]]. ...=G.J. |authorlink2=Carlton Caves |title=Generalized Uncertainty Relations: Theory, Examples, and Lorentz Invariance |journal=[[Annals of Physics]] |date=Apri ...4 KB (556 words) - 15:50, 15 September 2023
- ...g]], the '''Brassard–Høyer–Tapp algorithm''' or '''BHT algorithm''' is a [[quantum algorithm]] that solves the [[collision problem]]. In this problem, one is |title=Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range ...3 KB (405 words) - 10:17, 8 October 2024
- ...xed quantum states, there exist examples which lie between these different quantum correlation sets. The notion was initially proposed by [[Erwin Schrödinger] ...for Bell nonlocality and also a restriction for separable states model for quantum entanglement. ...5 KB (814 words) - 21:19, 25 February 2025
- ...0307|s2cid=221103573 }}</ref> Classical shadow is useful for [[Fidelity of quantum states|direct fidelity estimation]], entanglement verification, estimating ...learn to solve [[ground state]]s of quantum many-body systems and classify quantum [[State of matter|phases of matter]]. ...5 KB (745 words) - 19:43, 9 December 2023
- ...t=Kato|first=Tosio|title=On the eigenfunctions of many-particle systems in quantum mechanics|journal=Communications on Pure and Applied Mathematics|year=1957| ...E. Bright Wilson's]] argument within the framework of [[density functional theory]] (DFT). The electron density of the ground state of a molecular system con ...2 KB (325 words) - 19:12, 15 July 2024
- ...tate from its transformed counterpart under the influence of the specified quantum channel. ...2130|bibcode=2013PhRvA..88e2130L |s2cid=43563970 |arxiv=1107.5849 }}</ref> quantum error correction,<ref>{{Cite journal |last1=Furuya |first1=Keiichiro |last2 ...7 KB (931 words) - 04:33, 6 January 2025