|
Peter W. Shor
Peter Williston Shor (born August 14, 1959) is an American professor of applied mathematics at MIT. He is known for his work on quantum computation, in particular for devising Shor's algorithm, a quantum algorithm for factoring exponentially faster than the best currently-known algorithm running on a classical computer. Early life and education Shor was born in New York City to Joan Bopp Shor and S. W. Williston Shor, of Jewish descent. He grew up in Washington, D.C. and Mill Valley, California. While attending Tamalpais High School, he placed third in the 1977 USA Mathematical Olympiad. After graduation that year, he won a silver medal at the International Math Olympiad in Yugoslavia (the U.S. team achieved the most points per country that year). He received his B.S. in Mathematics in 1981 for undergraduate work at Caltech, and was a Putnam Fellow in 1978. He earned his PhD in Applied Mathematics from MIT in 1985. His doctoral advisor was F. Thomson Leighton, and his thesis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Peter Shore
Peter David Shore, Baron Shore of Stepney, (20 May 1924 – 24 September 2001) was a British Labour Party (UK), Labour Party politician and former UK Cabinet, Cabinet Minister, noted in part for his opposition to the United Kingdom's entry into the European Union, European Economic Community. His idiosyncratic left-wing nationalism led to comparison with the French politician Jean-Pierre Chevènement. He was described in an obituary by the Conservative journalist Patrick Cosgrave as "Between Harold Wilson and Tony Blair, the only possible Labour Party leader of whom a Conservative leader had cause to walk in fear" and, along with Enoch Powell, "the most captivating rhetorician of the age". Early life Born in Great Yarmouth, Norfolk, Shore was the son of a British Merchant Navy, Merchant Navy captain and was brought up in a middle-class environment. He attended Quarry Bank High School in Liverpool and, from there, went to King's College, Cambridge, to read History as an Exhibiti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
King Faisal International Prize
The King Faisal Prize ( ar, جائزة الملك فيصل, formerly King Faisal International Prize), is an annual award sponsored by King Faisal Foundation presented to "dedicated men and women whose contributions make a positive difference". The foundation awards prizes in five categories: Service to Islam; Islamic studies; the Arabic language and Arabic literature; science; and medicine. Three of the prizes are widely considered as the most prestigious awards in the Muslim world. The first King Faisal Prize was awarded to the Pakistani scholar Abul A'la Maududi in the year 1979 for his service to Islam. In 1981, Khalid of Saudi Arabia received the same award. In 1984, Fahd of Saudi Arabia was the recipient of the award. In 1986, this prize was co-awarded to Ahmed Deedat and French Roger Garaudy. Award process Designation of subjects Each year, the selection committees designate subjects in Islamic Studies, Arabic Literature, and Medicine. Selected topics in Islamic Studies ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Professor
Professor (commonly abbreviated as Prof.) is an Academy, academic rank at university, universities and other post-secondary education and research institutions in most countries. Literally, ''professor'' derives from Latin as a "person who professes". Professors are usually experts in their field and teachers of the highest rank. In most systems of List of academic ranks, academic ranks, "professor" as an unqualified title refers only to the most senior academic position, sometimes informally known as "full professor". In some countries and institutions, the word "professor" is also used in titles of lower ranks such as associate professor and assistant professor; this is particularly the case in the United States, where the unqualified word is also used colloquially to refer to associate and assistant professors as well. This usage would be considered incorrect among other academic communities. However, the otherwise unqualified title "Professor" designated with a capital let ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quantum Threshold Theorem
In quantum computing, the threshold theorem (or quantum fault-tolerance theorem) states that a quantum computer with a physical error rate below a certain threshold can, through application of quantum error correction schemes, suppress the logical error rate to arbitrarily low levels. This shows that quantum computers can be made fault-tolerant, as an analogue to von Neumann's threshold theorem for classical computation. This result was proven (for various error models) by the groups of Dorit Aharanov and Michael Ben-Or; Emanuel Knill, Raymond Laflamme, and Wojciech Zurek; and Alexei Kitaev independently. These results built off a paper of Peter Shor, which proved a weaker version of the threshold theorem. Explanation The key question that the threshold theorem resolves is whether quantum computers in practice could perform long computations without succumbing to noise. Since a quantum computer will not be able to perform gate operations perfectly, some small constant error ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stabilizer Code
The theory of quantum error correction plays a prominent role in the practical realization and engineering of quantum computing and quantum communication devices. The first quantum error-correcting codes are strikingly similar to classical block codes in their operation and performance. Quantum error-correcting codes restore a noisy, decohered quantum state to a pure quantum state. A stabilizer quantum error-correcting code appends ancilla qubits to qubits that we want to protect. A unitary encoding circuit rotates the global state into a subspace of a larger Hilbert space. This highly entangled, encoded state corrects for local noisy errors. A quantum error-correcting code makes quantum computation and quantum communication practical by providing a way for a sender and receiver to simulate a noiseless qubit channel given a noisy qubit channel whose noise conforms to a particular error model. The stabilizer theory of quantum error correction allows one to import some class ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
SMAWK Algorithm
The SMAWK algorithm is an algorithm for finding the minimum value in each row of an implicitly-defined totally monotone Matrix (mathematics), matrix. It is named after the initials of its five inventors, Peter Shor, Shlomo Moran, Alok Aggarwal, Robert Wilber, and Maria Klawe.. Input For the purposes of this algorithm, a matrix is defined to be monotone if each row's minimum value occurs in a column which is equal to or greater than the column of the previous row's minimum. It is totally monotone if the same property is true for every submatrix (defined by an arbitrary subset of the rows and columns of the given matrix). Equivalently, a matrix is totally monotone if there does not exist a 2×2 submatrix whose row minima are in the top right and bottom left corners. Every Monge array is totally monotone, but not necessarily vice versa. For the SMAWK algorithm, the matrix to be searched should be defined as a function, and this function is given as input to the algorithm (together with ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
CSS Code
In quantum error correction, CSS codes, named after their inventors, Robert Calderbank, Peter Shor and Andrew Steane, are a special type of stabilizer code constructed from classical codes with some special properties. An example of a CSS code is the Steane code The Steane code is a tool in quantum error correction introduced by Andrew Steane in 1996. It is a CSS code (Calderbank-Shor-Steane), using the classical binary ,4,3Hamming code to correct for qubit flip errors (X errors) and the dual (mathema .... Construction Let C_1 and C_2 be two (classical) ,k_1/math>, ,k_2/math> codes such, that C_2 \subset C_1 and C_1 , C_2^\perp both have minimal distance \geq 2t+1, where C_2^\perp is the code dual to C_2. Then define \text(C_1,C_2), the CSS code of C_1 over C_2 as an ,k_1 - k_2, d/math> code, with d \geq 2t+1 as follows: Define for x \in C_1 : x + C_2 \rangle := 1 / \sqrt \sum_ x + y \rangle, where + is bitwise addition modulo 2. Then \text( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Shor Code
Quantum error correction (QEC) is used in quantum computing to protect quantum information from errors due to decoherence and other quantum noise. Quantum error correction is theorised as essential to achieve fault tolerant quantum computing that can reduce the effects of noise on stored quantum information, faulty quantum gates, faulty quantum preparation, and faulty measurements. Classical error correction employs redundancy. The simplest albeit inefficient approach is the repetition code. The idea is to store the information multiple times, and—if these copies are later found to disagree—take a majority vote; e.g. suppose we copy a bit in the one state three times. Suppose further that a noisy error corrupts the three-bit state so that one of the copied bits is equal to zero but the other two are equal to one. Assuming that noisy errors are independent and occur with some sufficiently low probability ''p'', it is most likely that the error is a single-bit error and the tran ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Shor's Algorithm
Shor's algorithm is a quantum algorithm, quantum computer algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor. On a quantum computer, to factor an integer N , Shor's algorithm runs in polynomial time, meaning the time taken is polynomial in \log N , the size of the integer given as input. Specifically, it takes quantum logic gate, quantum gates of order O \! \left((\log N)^ (\log \log N) (\log \log \log N) \right) using fast multiplication, or even O \! \left((\log N)^ (\log \log N) \right) utilizing the asymptotically fastest multiplication algorithm currently known due to Harvey and Van Der Hoven, thus demonstrating that the integer factorization problem can be efficiently solved on a quantum computer and is consequently in the complexity class BQP. This is almost exponentially faster than the most efficient known classical factoring algorithm, the ge ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Breakthrough Prize In Fundamental Physics
The Breakthrough Prize in Fundamental Physics is one of the Breakthrough Prizes, awarded by the Breakthrough Prize Board. Initially named Fundamental Physics Prize, it was founded in July 2012 by Russia-born Israeli entrepreneur, venture capitalist and physicist Yuri Milner. The prize is awarded to physicists from theoretical, mathematical, or experimental physics that have made transformative contributions to fundamental physics, and specifically for recent advances. Worth USD$3 million, the prize is the most lucrative physics prize in the world and is more than twice the amount given to the Nobel Prize awardees. Unlike the annual Breakthrough Prize in Fundamental Physics, the Special Breakthrough Prize is not limited to recent discoveries, while the prize money is still USD$3 million. Physics Frontiers Prize has only been awarded for 2 years. Laureates are automatically nominated for next year's Breakthrough Prize in Fundamental Physics. If they are not awarded the prize the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
BBVA Foundation Frontiers Of Knowledge Award
The BBVA Foundation Frontiers of Knowledge Awards () are an international award programme recognizing significant contributions in the areas of scientific research and cultural creation. The categories that make up the Frontiers of Knowledge Awards respond to the knowledge map of the present age. As well as the fundamental knowledge that is at their core, they address developments in information and communication technologies, and interactions between biology and medicine, ecology and conservation biology, climate change, economics, humanities and social sciences, and, finally, contemporary musical creation and performance. Specific categories are reserved for developing knowledge fields of critical relevance to confront central challenges of the 21st century, as in the case of the two environmental awards. The awards were established in 2008, with the first set of winners receiving their prizes in 2009. The BBVA Foundation – belonging to financial group BBVA – is partnered in t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
IEEE Eric E
The Institute of Electrical and Electronics Engineers (IEEE) is a 501(c)(3) professional association for electronic engineering and electrical engineering (and associated disciplines) with its corporate office in New York City and its operations center in Piscataway, New Jersey. The mission of the IEEE is ''advancing technology for the benefit of humanity''. The IEEE was formed from the amalgamation of the American Institute of Electrical Engineers and the Institute of Radio Engineers in 1963. Due to its expansion of scope into so many related fields, it is simply referred to by the letters I-E-E-E (pronounced I-triple-E), except on legal business documents. , it is the world's largest association of technical professionals with more than 423,000 members in over 160 countries around the world. Its objectives are the educational and technical advancement of electrical and electronic engineering, telecommunications, computer engineering and similar disciplines. History Orig ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
