Decoherence-protected quantum register of nuclear spins in diamond

Solid-state quantum registers are exceptional for storing quantum information at room temperature with long coherence time. Nevertheless, practical applications toward quantum supremacy require even longer coherence time to allow for more complex algorithms. In this work we propose a quantum register that lies in a decoherence-protected subspace to be implemented with nuclear spins nearby a Nitrogen-Vacancy center in diamond. The quantum information is encoded in two logical states composed of two Carbon-13 nuclear spins, while an electron spin is used as ancilla for initialization and control. Moreover, by tuning an off-axis magnetic field we enable non-nuclear-spin- preserving transitions that we use for preparing and manipulating the register through Stimulating Raman Adiabatic Passage. Furthermore, we consider more elaborated sequences to improve simultaneous control over the system yielding decreased gate time.

Quantum search for scaled hash function preimages

We present the implementation of Grover’s algorithm in a quantum simulator to perform a quantum search for preimages of two scaled hash functions, whose design only uses modular addition, word rotation and bitwise exclusive or. Our implementation provides the means to assess with precision the scaling of the number of gates and depth of a full-fledged quantum circuit designed to find the preimages of a given hash digest. The detailed construction of the quantum oracle shows that the presence of AND gates, OR gates, shifts of bits and the reuse of the initial state along the computation require extra quantum resources as compared with other hash functions based on modular additions, XOR gates and rotations. We also track the entanglement entropy present in the quantum register at every step along the computation, showing that it becomes maximal at the inner core of the first action of the quantum oracle, which implies that no classical simulation based on tensor networks would be of relevance. Finally, we show that strategies that suggest a shortcut based on sampling the quantum register after a few steps of Grover’s algorithm can only provide some marginal practical advantage in terms of error mitigation.

Conditions for superdecoherence

Decoherence is the main obstacle to quantum computation. The decoherence rate per qubit is typically assumed to be constant. It is known, however, that quantum registers coupling to a single reservoir can show a decoherence rate per qubit that increases linearly with the number of qubits. This effect has been referred to as superdecoherence, and has been suggested to pose a threat to the scalability of quantum computation. Here, we show that superdecoherence is absent when the spectrum of the single reservoir is continuous, rather than discrete. The reason of this absence, is that, as the number of qubits is increased, a quantum register inevitably becomes susceptible to an ever narrower bandwidth of frequencies in the reservoir. Furthermore, we show that for superdecoherence to occur in a reservoir with a discrete spectrum, one of the frequencies in the reservoir has to coincide exactly with the frequency the quantum register is most susceptible to. We thus fully resolve the conditions that determine the presence or absence of superdecoherence. We conclude that superdecoherence is easily avoidable in practical realizations of quantum computers.

Spin Foam Vertex Amplitudes on Quantum Computer—Preliminary Results

Vertex amplitudes are elementary contributions to the transition amplitudes in the spin foam models of quantum gravity. The purpose of this article is to make the first step towards computing vertex amplitudes with the use of quantum algorithms. In our studies we are focused on a vertex amplitude of 3+1 D gravity, associated with a pentagram spin network. Furthermore, all spin labels of the spin network are assumed to be equal j = 1 / 2 , which is crucial for the introduction of the intertwiner qubits. A procedure of determining modulus squares of vertex amplitudes on universal quantum computers is proposed. Utility of the approach is tested with the use of: IBM’s ibmqx4 5-qubit quantum computer, simulator of quantum computer provided by the same company and QX quantum computer simulator. Finally, values of the vertex probability are determined employing both the QX and the IBM simulators with 20-qubit quantum register and compared with analytical predictions.

A Logic for Quantum Register Measurements

We know that quantum logics are the most prominent logical systems associated to the lattices of closed Hilbert subspaces. However, what happen if, following a quantum computing perspective, we want to associate a logic to the process of quantum registers measurements? This paper gives an answer to this question, and, quite surprisingly, shows that such a logic is nothing else that the standard propositional intuitionistic logic.