Gilbert-Varshamov bound
Also found in: Acronyms, Wikipedia.
Gilbert-Varshamov bound
[¦gil·bərt‚vär¦sha·məv ¦bau̇nd] (computer science)
In the theory of quantum computation, a sufficient condition for an algorithm that encodes N logical qubits into N ? carrier qubits (with N ? larger than N) to correct any error on any M carrier qubits; namely, that N / N ? be smaller than 1 - 2[-x log2 x - (1 -x) log2(1 - x)], where x = 2 M / N ?.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
Copyright © 2003-2025 Farlex, Inc
Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.