Quantum Computation and Quantum Information: Bibliography

By Nikolay Raychev, Isaac L. Chuang. 2010

12,058 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/277a330bd9bf3cf8279c685238c1a8b01d99f0c8

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

Citations in the corpus

Quantum coherence and geometric quantum discord (2017, background): “s distance of discord The distance between two states ρand σcan also be quantiﬁed by the Bures distance D B(ρ,σ) = 2[1− p F(ρ,σ)], (51) where F(ρ,σ) = tr( √ ρσ √ ρ)1/2 2 , (52) is the Uhlmannﬁdelity (Nielsen and Chuang, 2000). The Buresdistancesatisfythepreferablepropertiesofjointconvexity, i.e., D ”
Quantum Zeno effect by general measurements (2004, methodology): “, in quantum information theory [68,69].”
Entanglement purification and quantum error correction (2007, background): “Refs. [ 10 , 11, 12] for reviews, and also [2, 13, 14, 15, 16, 17, 18, 19, 20, 21]), quantum information is protected by encoding one logical qubit of quantum information into several physical qubits, or more generally k logical qubits into n physical qubits.”
Variational quantum algorithms for nonlinear problems (2019, background): “1(b) is composed of generic two-qubit gates that in an experiment are accurately approximated by short sequences of gates if a sufficiently tunable or universal gate set is experimentally available [70].”
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial (2005, methodology): “e path model representation. Using these notions we describe the algorithms in Section 3 and prove their correctness. 4 2 Background 2.1 Quantum Computation For background on quantum computation, see [23]. We merely mention here that, strictly speaking, we use here a quantum-classical hybrid model o”
t|ket⟩: a retargetable compiler for NISQ devices (2020, methodology): “We will adopt a wider definition: a NISQ device is any quantum computer for which general-purpose quantum error correction [18] is not feasible and hardware errors are expected.”
Colloquium: Non-Markovian dynamics in open quantum systems (2015, background): “The trace distance has a series of interesting mathematical and physical features which make it a useful distance measure in quantum information theory (Nielsen and Chuang, 2000).”
Universal Dynamical Decoupling of a Single Solid-State Spin from a Spin Bath (2010, background): “ntum states x and y (Fig. 2D). We study the decoupling performance in more detail with the use of quantum process tomography (QPT), which allows for a complete characterization of any quantum process (29). Figure 3 shows the experimental QPT results for XY4 with = 8 N operations, at different free e”
Quantum Generative Adversarial Networks for learning and loading random distributions (2019, methodology): “one per qubit [3].”
Realization of three-qubit quantum error correction with superconducting circuits (2011, background): “The simplest of these are three-quantum-bit (three-qubit) codes, which map a one-qubit state to an entangled three-qubit state; they can correct any single phase-flip or bit-flip error on one of the three qubits, depending on the code use”
Ultrafast optical control of entanglement between two quantum-dot spins (2010, background): “A well-known route to universal control is single-qubit gates for each QD and an entangling two-qubit gat”
Entangled states of trapped atomic ions (2008, neutral): “This marked the beginning of widespread interest in quantum information processin”