Memory-built-in quantum cloning in a hybrid solid-state spin register

Efficient Implementation of a Quantum Algorithm in a Single Nitrogen-Vacancy Center of Diamond

Quantum computers have the potential to speed up certain problems that are hard for classical computers. Hybrid systems, such as the nitrogen-vacancy (NV) center in diamond, are among the most promising systems to implement quantum computing, provided the control of the different types of qubits can be efficiently implemented. In the case of the NV center, the anisotropic hyperfine interaction allows one to control the nuclear spins indirectly, through gate operations targeting the electron spin, combined with free precession. Here, we demonstrate that this approach allows one to implement a full quantum algorithm, using the example of Grover's quantum search in a single NV center, whose electron is coupled to a carbon nuclear spin.

Experimentally attacking quantum money schemes based on quantum retrieval games

The concept of quantum money (QM) was proposed by Wiesner in the 1970s. Its main advantage is that every attempt to copy QM unavoidably leads to imperfect counterfeits. In the Wiesner’s protocol, quantum banknotes need to be delivered to the issuing bank for verification. Thus, QM requires quantum communication which range is limited by noise and losses. Recently, Bozzio et al. (2018) have demonstrated experimentally how to replace challenging quantum verification with a classical channel and a quantum retrieval game (QRG). This brings QM significantly closer to practical realisation, but still thorough analysis of the revised scheme QM is required before it can be considered secure. We address this problem by presenting a proof-of-concept attack on QRG-based QM schemes, where we show that even imperfect quantum cloning can, under some circumstances, provide enough information to break a QRG-based QM scheme.

Optimal Compression for Identically Prepared Qubit States

We establish the ultimate limits to the compression of sequences of identically prepared qubits. The limits are determined by Holevo's information quantity and are attained through use of the optimal universal cloning machine, which finds here a novel application to quantum Shannon theory.