相关论文: Always On Non-Nearest-Neighbor Coupling in Scalabl…
We propose a scheme for scalable and robust quantum computing on two-dimensional arrays of qubits with fixed longitudinal coupling. This opens the possibility for bypassing the device complexity associated with tunable couplers required in…
The prospect of computational hardware with quantum advantage relies critically on the quality of quantum gate operations. Imperfect two-qubit gates is a major bottleneck for achieving scalable quantum information processors. Here, we…
One of the main bottlenecks in the pursuit of a large-scale--chip-based quantum computer is the large number of control signals needed to operate qubit systems. As system sizes scale up, the number of terminals required to connect to…
Large-scale quantum computation will only be achieved if experimentally implementable quantum error correction procedures are devised that can tolerate experimentally achievable error rates. We describe a quantum error correction procedure…
Entanglement entropy obeys area law scaling for typical physical quantum systems. This may naively be argued to follow from locality of interactions. We show that this is not the case by constructing an explicit simple spin chain…
In recent advancements of quantum computing utilizing spin qubits, it has been demonstrated that this platform possesses the potential for implementing two-qubit gates with fidelities exceeding 99.5%. However, as with other qubit platforms,…
In order to achieve speedup over conventional classical computing for finding solution of computationally hard problems, quantum computing was introduced. Quantum algorithms can be simulated in a pseudo quantum environment, but…
We consider experimentally feasible chains of trapped ions with pseudo-spin 1/2, and find models that can potentially be used to implement error-resistant quantum computation. Similar in spirit to classical neural networks, the…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
We combine elements of the 1998 quantum computing proposals by Privman, Vagner and Kventsel, and by Kane, with the new idea of nuclear-spin qubit interactions mediated indirectly via the bound outer electrons of impurity atoms whose nuclear…
In this study, we simulated the algorithmic performance of a small neutral atom quantum computer and compared its performance when operating with all-to-all versus nearest-neighbor connectivity. This comparison was made using a suite of…
Sample-based quantum diagonalization (SQD) is an algorithm for hybrid quantum-classical molecular simulation that has been of broad interest for application with noisy intermediate scale quantum (NISQ) devices. However, SQD does not always…
Noise in quantum hardware is the primary obstacle to realizing the transformative potential of quantum computing. Quantum error mitigation (QEM) offers a promising pathway to enhance computational accuracy on near-term devices, yet existing…
We report magnetoresistance data in magnetic semiconductor multilayers, which exhibit a clear step-wise behavior as a function of external field. We attribute this highly non-trivial step-wise behavior to next-nearest-neighbor interlayer…
Through the introduction of a new electron spin transport mechanism, a 2D donor electron spin quantum computer architecture is proposed. This design addresses major technical issues in the original Kane design, including spatial…
Spin network systems can be used to achieve quantum state transfer with high fidelity and to generate entanglement. A new approach to design spin-chain-based spin network systems, for shortrange quantum information processing and…
It is well known that the notions of spatial locality are often lost in quantum systems with long-range interactions, as exhibited by the emergence of phases with exotic long-range order and faster propagation of quantum correlations. We…
Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally…
Existing scalable superconducting quantum processors have only nearest-neighbor coupling. This leads to reduced circuit depth, requiring large series of gates to perform an arbitrary unitary operation in such systems. Recently, multi-modal…
Due to the physics behind quantum computing, quantum circuit designers must adhere to the constraints posed by the limited interaction distance of qubits. Existing circuits need therefore to be modified via the insertion of SWAP gates,…