Related papers: Spin-projection for quantum computation: A low-dep…
We discuss here some aspects related to the symmetries of a quantum many-body problem when trying to treat it on a quantum computer. Several features related to symmetry conservation, symmetry breaking, and possible symmetry restoration are…
A powerful control method in experimental quantum computing is the use of spin echoes, employed to select a desired term in the system's internal Hamiltonian, while refocusing others. Here we address a more general problem, describing a…
With quantum computers of significant size now on the horizon, we should understand how to best exploit their initially limited abilities. To this end, we aim to identify a practical problem that is beyond the reach of current classical…
Optically interfaced spins in the solid promise scalable quantum networks. Robust and reliable optical properties have so far been restricted to systems with inversion symmetry. Here, we release this stringent constraint by demonstrating…
The design and control of atomic-scale spin structures constitute major challenges for spin-based quantum technology platforms, including quantum dots, color centers, and molecular spins. Here, we showcase a strategy for designing the…
Quantum control requires full knowledge of the system many-body Hamiltonian. In many cases this information is not directly available due to restricted access to the system. Here we show how to indirectly estimate all the coupling strengths…
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…
We propose a quantum feedback scheme for producing deterministically reproducible spin squeezing. The results of a continuous nondemolition atom number measurement are fed back to control the quantum state of the sample. For large samples…
We present a new method to perform variation after projection in many-body systems on quantum computers that does not require performing explicit projection. The technique employs the notion of ``oracle'', generally used in quantum search…
The majority of current understanding of the quantum correlations is in the field of non-relativistic quantum mechanics. To develop quantum information and computation tasks fully, one must inevitably take into account the relativistic…
Quantum simulation is a promising near term application for mesoscale quantum information processors, with the potential to solve computationally intractable problems at the scale of just a few dozen interacting quantum systems. Recent…
We consider the question of what quantum spin chains naturally encode in their Hilbert space. It turns out that quantum spin chains are rather rich systems, naturally encoding solutions to various problems in combinatorics, group theory,…
Electronic structure simulation is an anticipated application for quantum computers. Due to high-dimensional quantum entanglement in strongly correlated systems, the quantum resources required to perform such simulations are far beyond the…
Current implementations of quantum computers suffer from large numbers of control lines per qubit, becoming unmanageable with system scale up. Here, we discuss a sparse spin-qubit architecture featuring integrated control electronics…
Simulating the dynamics of large quantum systems is a formidable yet vital pursuit for obtaining a deeper understanding of quantum mechanical phenomena. While quantum computers hold great promise for speeding up such simulations, their…
The main features of quantum computing are described in the framework of spin resonance methods. Stress is put on the fact that quantum computing is in itself nothing but a re-interpretation (fruitful indeed) of well-known concepts. The…
The permutation symmetry is a fundamental attribute of the collective wavefunction of indistinguishable particles. It makes a difference for the behavior of collective systems having different quantum statistics but existing in the same…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
We establish efficient algorithms for weakly-interacting quantum spin systems at arbitrary temperature. In particular, we obtain a fully polynomial-time approximation scheme for the partition function and an efficient approximate sampling…
Spin coherent states play a crucial role in defining QESM (quasi-exactly solvable models) establishing a strict correspondence between energy spectra of spin systems and low-lying quantum states for a particle moving in a potential field of…