Superstring theoryをめぐって(放談室)

The spin states of single electrons in gate-defined quantum dots satisfy crucial requirements for a practical quantum computer. These include extremely long coherence times, high-fidelity quantum operation, and the ability to shuttle electrons as a mechanism for on-chip flying qubits. To increase the number of qubits to the thousands or millions of qubits needed for practical quantum information, we present an architecture based on shared control and a scalable number of lines. Crucially, the control lines define the qubit grid, such that no local components are required. Our design enables qubit coupling beyond nearest neighbors, providing prospects for nonplanar quantum error correction protocols. Fabrication is based on a three-layer design to define qubit and tunnel barrier gates. We show that a double stripline on top of the structure can drive high-fidelity single-qubit rotations. Self-aligned inhomogeneous magnetic fields induced by direct currents through superconducting gates enable qubit addressability and readout. Qubit coupling is based on the exchange interaction, and we show that parallel two-qubit gates can be performed at the detuning-noise insensitive point. While the architecture requires a high level of uniformity in the materials and critical dimensions to enable shared control, it stands out for its simplicity and provides prospects for large-scale quantum computation in the near future.

https://advances.sciencemag.org/content/advances/4/7/eaar3960.full.pdf

A crossbar network for silicon quantum dot qubits.

The class of commuting quantum circuits known as IQP (instantaneous quantum polynomial-time) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures. Here we study the power of IQP circuits in the presence of physically motivated constraints. First, we show that there is a family of sparse IQP circuits that can be implemented on a square lattice of n qubits in depth O(sqrt(n) log n), and which is likely hard to simulate classically. Next, we show that, if an arbitrarily small constant amount of noise is applied to each qubit at the end of any IQP circuit whose output probability distribution is sufficiently anticoncentrated, there is a polynomial-time classical algorithm that simulates sampling from the resulting distribution, up to constant accuracy in total variation distance. However, we show that purely classical error-correction techniques can be used to design IQP circuits which remain hard to simulate classically, even in the presence of arbitrary amounts of noise of this form. These results demonstrate the challenges faced by experiments designed to demonstrate quantum supremacy over classical computation, and how these challenges can be overcome.

/pdf/achieving-quantum-supremacy-with-sparse-and-noisy-commuting-bdzq70j9ja.pdf

Achieving quantum supremacy with sparse and noisy commuting quantum computations

Quantum information technology based on solid state qubits has created much interest in converting quantum states from the microwave to the optical domain. Optical photons, unlike microwave photons, can be transmitted by fiber, making them suitable for long distance quantum communication. Moreover, the optical domain offers access to a large set of very well‐developed quantum optical tools, such as highly efficient single‐photon detectors and long‐lived quantum memories. For a high fidelity microwave to optical transducer, efficient conversion at single photon level and low added noise is needed. Currently, the most promising approaches to build such systems are based on second‐order nonlinear phenomena such as optomechanical and electro‐optic interactions. Alternative approaches, although not yet as efficient, include magneto‐optical coupling and schemes based on isolated quantum systems like atoms, ions, or quantum dots. Herein, the necessary theoretical foundations for the most important microwave‐to‐optical conversion experiments are provided, their implementations are described, and the current limitations and future prospects are discussed.

/pdf/coherent-conversion-between-microwave-and-optical-photons-an-1maw4b9hrv.pdf

Coherent Conversion Between Microwave and Optical Photons—An Overview of Physical Implementations

To run quantum algorithms on emerging gate-model quantum hardware, quantum circuits must be compiled to take into account constraints on the hardware. For near-term hardware, with only limited means to mitigate decoherence, it is critical to minimize the duration of the circuit. We investigate the application of temporal planners to the problem of compiling quantum circuits to newly emerging quantum hardware. While our approach is general, we focus on compiling to superconducting hardware architectures with nearest neighbor constraints. Our initial experiments focus on compiling Quantum Alternating Operator Ansatz (QAOA) circuits whose high number of commuting gates allow great flexibility in the order in which the gates can be applied. That freedom makes it more challenging to find optimal compilations but also means there is a greater potential win from more optimized compilation than for less flexible circuits. We map this quantum circuit compilation problem to a temporal planning problem, and generated a test suite of compilation problems for QAOA circuits of various sizes to a realistic hardware architecture. We report compilation results from several state-of-the-art temporal planners on this test set. This early empirical evaluation demonstrates that temporal planning is a viable approach to quantum circuit compilation.

https://iopscience.iop.org/article/10.1088/2058-9565/aaa331/pdf

Compiling quantum circuits to realistic hardware architectures using temporal planners

We provide algorithms for efficiently moving and addressing quantum memory in parallel. These imply that the standard circuit model can be simulated with a low overhead by a more realistic model of a distributed quantum computer. As a result, the circuit model can be used by algorithm designers without worrying whether the underlying architecture supports the connectivity of the circuit. In addition, we apply our results to existing memory-intensive quantum algorithms. We present a parallel quantum search algorithm and improve the time–space trade-off for the element distinctness and collision finding problems.

https://royalsocietypublishing.org/doi/pdf/10.1098/rspa.2012.0686

Efficient distributed quantum computing

Aiming at a complete classification of unitary N = 2 minimal models (where the assumption of space-time supersymmetry has been dropped), it is shown that each modular invariant candidate partition function of such a theory is indeed the partition function of a fully-fledged unitary N = 2 minimal model, subject to the assumptions that orbifolding is a ‘physical’ process and that the space-time supersymmetric $${\mathcal{A}}$$
 -
 $${\mathcal{D}}$$
 -
 $${\mathcal{E}}$$
 models are physical. A family of models constructed via orbifoldings of either the diagonal model or of the space-time supersymmetric exceptional models then demonstrates that there exists a unitary N = 2 minimal model for every one of the allowed partition functions in the list obtained from Gannon’s work (Gannon in Nucl Phys B 491:659–688, 1997). Kreuzer and Schellekens’ conjecture (Nucl Phys B 411:97–121, 1994) that all simple current invariants can be obtained as orbifolds of the diagonal model, even when the extra assumption of higher-genus modular invariance is dropped, is confirmed in the case of the unitary N = 2 minimal models by simple counting arguments.

/pdf/on-the-complete-classification-of-unitary-n-2-minimal-2h2fv0out2.pdf

On the Complete Classification of Unitary N = 2 Minimal Superconformal Field Theories

We provide algorithms for efficiently addressing quantum memory in parallel. These imply that the standard circuit model can be simulated with low overhead by the more realistic model of a distributed quantum computer. As a result, the circuit model can be used by algorithm designers without worrying whether the underlying architecture supports the connectivity of the circuit. In addition, we apply our results to existing memory intensive quantum algorithms. We present a parallel quantum search algorithm and improve the time-space trade-off for the Element Distinctness and Collision problems.

Oliver Gray

Papers

Efficient distributed quantum computing

On the Complete Classification of Unitary N = 2 Minimal Superconformal Field Theories

Efficient Distributed Quantum Computing