FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2552321328> ?p ?o ?g. }

• W2552321328 abstract "Quantum algorithms for problems such as integer factorization and database search have spurred great interest in quantum computation. However, the construction of scalable quantum computers has proved to be extremely difficult. Among the challenging requirements that must be fulfilled in the “standard model” of quantum computation, one must be able to initialize qubits into known pure states. In addition, quantum computers must be protected from noise due to unwanted interactions with their environment. This work is concerned with two theoretical issues motivated by these difficulties. First, I analyze the efficiency of an algorithm for an alternate model for quantum computation that is motivated by bulk nuclear magnetic resonance. In such ensemble systems, the initial state is not a fiducial pure state, but is instead a maximally-mixed density operator. The algorithm that I consider allows one to estimate the free energy of arbitrary spin-1/2 lattice models. To determine the efficiency of this algorithm, I calculate the computation time required to estimate the free energy to bounded error as a function of the lattice size. In the absence of stochastic fluctuations in the measurement output, it is found that the algorithm is efficient. However, evidence is presented that suggests that the algorithm becomes exponentially sensitive to fluctuations as the lattice size increases. While techniques such as quantum error-correcting codes and decoherence-free subsystem encodings have been devised to mitigate errors due to unwanted environmental couplings, these methods require many additional qubits or complicated encodings. Here, I investigate a simple approach to reduce errors in the quantum search algorithm due to a collective decoherence model. This method takes advantage of the freedom inherent in compiling the search algorithm into fundamental gates. Transition rate calculations and more rigorous quantum master equation simulations are carried out for small-qubit instances to contrast the performance of the original and modified algorithm. It is shown that the expected computational effort can be reduced by 22% for selected five-bit instances of the quantum search algorithm. While this approach does not constitute a general strategy for quantum error-correction, it illustrates the importance of judicious gate design in mitigating decoherence." @default.
• W2552321328 created "2016-11-30" @default.
• W2552321328 creator A5000828322 @default.
• W2552321328 creator A5071256887 @default.
• W2552321328 date "2005-01-01" @default.
• W2552321328 modified "2023-10-03" @default.
• W2552321328 title "Quantum computing under real-world constraints: efficiency of an ensemble quantum algorithm and fighting decoherence by gate design" @default.
• W2552321328 hasPublicationYear "2005" @default.
• W2552321328 type Work @default.
• W2552321328 sameAs 2552321328 @default.
• W2552321328 citedByCount "3" @default.
• W2552321328 countsByYear W25523213282014 @default.
• W2552321328 countsByYear W25523213282015 @default.
• W2552321328 crossrefType "journal-article" @default.
• W2552321328 hasAuthorship W2552321328A5000828322 @default.
• W2552321328 hasAuthorship W2552321328A5071256887 @default.
• W2552321328 hasConcept C11413529 @default.
• W2552321328 hasConcept C121332964 @default.
• W2552321328 hasConcept C122527463 @default.
• W2552321328 hasConcept C137019171 @default.
• W2552321328 hasConcept C191608238 @default.
• W2552321328 hasConcept C192122513 @default.
• W2552321328 hasConcept C203087015 @default.
• W2552321328 hasConcept C41008148 @default.
• W2552321328 hasConcept C51003876 @default.
• W2552321328 hasConcept C58053490 @default.
• W2552321328 hasConcept C62520636 @default.
• W2552321328 hasConcept C84114770 @default.
• W2552321328 hasConceptScore W2552321328C11413529 @default.
• W2552321328 hasConceptScore W2552321328C121332964 @default.
• W2552321328 hasConceptScore W2552321328C122527463 @default.
• W2552321328 hasConceptScore W2552321328C137019171 @default.
• W2552321328 hasConceptScore W2552321328C191608238 @default.
• W2552321328 hasConceptScore W2552321328C192122513 @default.
• W2552321328 hasConceptScore W2552321328C203087015 @default.
• W2552321328 hasConceptScore W2552321328C41008148 @default.
• W2552321328 hasConceptScore W2552321328C51003876 @default.
• W2552321328 hasConceptScore W2552321328C58053490 @default.
• W2552321328 hasConceptScore W2552321328C62520636 @default.
• W2552321328 hasConceptScore W2552321328C84114770 @default.
• W2552321328 hasLocation W25523213281 @default.
• W2552321328 hasOpenAccess W2552321328 @default.
• W2552321328 hasPrimaryLocation W25523213281 @default.
• W2552321328 hasRelatedWork W1547159441 @default.
• W2552321328 hasRelatedWork W1665570390 @default.
• W2552321328 hasRelatedWork W2004733369 @default.
• W2552321328 hasRelatedWork W2031360293 @default.
• W2552321328 hasRelatedWork W2109741106 @default.
• W2552321328 hasRelatedWork W2133736752 @default.
• W2552321328 hasRelatedWork W2167970331 @default.
• W2552321328 hasRelatedWork W2460236770 @default.
• W2552321328 hasRelatedWork W2535442253 @default.
• W2552321328 hasRelatedWork W2604110432 @default.
• W2552321328 hasRelatedWork W2770374365 @default.
• W2552321328 hasRelatedWork W2808972567 @default.
• W2552321328 hasRelatedWork W3042066541 @default.
• W2552321328 hasRelatedWork W3088378517 @default.
• W2552321328 hasRelatedWork W3098154398 @default.
• W2552321328 hasRelatedWork W3098994143 @default.
• W2552321328 hasRelatedWork W3132125399 @default.
• W2552321328 hasRelatedWork W3173744408 @default.
• W2552321328 hasRelatedWork W3210311687 @default.
• W2552321328 isParatext "false" @default.
• W2552321328 isRetracted "false" @default.
• W2552321328 magId "2552321328" @default.
• W2552321328 workType "article" @default.