Catálogo de publicaciones - revistas

<jats:title>Abstract</jats:title> <jats:p>Scaling trapped-ion quantum computing will require robust trapping of at least hundreds of ions over long periods, while increasing the complexity and functionality of the trap itself. Symmetric three-dimensional (3D) structures enable high trap depth, but microfabrication techniques are generally better suited to planar structures that produce less ideal conditions for trapping. We present an ion trap fabricated on stacked eight-inch wafers in a large-scale micro-electro-mechanical system microfabrication process that provides reproducible traps at a large volume. Electrodes are patterned on the surfaces of two opposing wafers bonded to a spacer, forming a 3D structure with 2.5 <jats:italic>μ</jats:italic>m standard deviation in alignment across the stack. We implement a design achieving a trap depth of 1 eV for a <jats:sup>40</jats:sup>Ca<jats:sup>+</jats:sup> ion held at 200 <jats:italic>μ</jats:italic>m from either electrode plane. We characterize traps, achieving measurement agreement with simulations to within ±5% for mode frequencies spanning 0.6–3.8 MHz, and evaluate stray electric field across multiple trapping sites. We measure motional heating rates over an extensive range of trap frequencies, and temperatures, observing 40 phonons/s at 1 MHz and 185 K. This fabrication method provides a highly scalable approach for producing a new generation of 3D ion traps.</jats:p>

<jats:title>Abstract</jats:title> <jats:p>The recent observation of high-lying Rydberg states of excitons in semiconductors with relatively high binding energy motivates exploring their applications in quantum nonlinear optics and quantum information processing. Here, we study Rydberg excitation dynamics of a mesoscopic array of excitons to demonstrate its application in simulation of quantum many-body dynamics. We show that the <jats:inline-formula> <jats:tex-math><?CDATA ${\mathbb{Z}}_{2}$?></jats:tex-math> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:msub> <mml:mrow> <mml:mi mathvariant="double-struck">Z</mml:mi> </mml:mrow> <mml:mrow> <mml:mn>2</mml:mn> </mml:mrow> </mml:msub> </mml:math> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="qstac70f4ieqn1.gif" xlink:type="simple" /> </jats:inline-formula>-ordered phase can be reached using physical parameters available for cuprous oxide (Cu<jats:sub>2</jats:sub>O) by optimizing driving laser parameters such as duration, intensity, and frequency. In an example, we study the application of our proposed system to solving the maximum independent set problem based on the Rydberg blockade effect.</jats:p>

<jats:title>Abstract</jats:title> <jats:p>Variational quantum circuits (VQCs) have shown great potential in near-term applications. However, the discriminative power of a VQC, in connection to its circuit architecture and depth, is not understood. To unleash the genuine discriminative power of a VQC, we propose a VQC system with the optimal classical post-processing—maximum-likelihood estimation on measuring all VQC output qubits. Via extensive numerical simulations, we find that the error of VQC quantum data classification typically decays exponentially with the circuit depth, when the VQC architecture is extensive—the number of gates does not shrink with the circuit depth. This fast error suppression ends at the saturation towards the ultimate Helstrom limit of quantum state discrimination. On the other hand, non-extensive VQCs such as quantum convolutional neural networks are sub-optimal and fail to achieve the Helstrom limit, demonstrating a trade-off between ansatz complexity and classification performance in general. To achieve the best performance for a given VQC, the optimal classical post-processing is crucial even for a binary classification problem. To simplify VQCs for near-term implementations, we find that utilizing the symmetry of the input properly can improve the performance, while oversimplification can lead to degradation.</jats:p>

<jats:title>Abstract</jats:title> <jats:p>We have integrated single and coupled superconducting transmon qubits into flip-chip modules. Each module consists of two chips—one quantum chip and one control chip—that are bump-bonded together. We demonstrate time-averaged coherence times exceeding 90 μs, single-qubit gate fidelities exceeding 99.9%, and two-qubit gate fidelities above 98.6%. We also present device design methods and discuss the sensitivity of device parameters to variation in interchip spacing. Notably, the additional flip-chip fabrication steps do not degrade the qubit performance compared to our baseline state-of-the-art in single-chip, planar circuits. This integration technique can be extended to the realisation of quantum processors accommodating hundreds of qubits in one module as it offers adequate input/output wiring access to all qubits and couplers.</jats:p>

<jats:title>Abstract</jats:title> <jats:p>Mediated semi-quantum key distribution involves the use of two end-users who have very restricted, almost classical, capabilities, who wish to establish a shared secret key using the help of a fully-quantum server who may be adversarial. In this paper, we introduce a new mediated semi-quantum key distribution protocol, extending prior work, which has asymptotically perfect efficiency. Though this comes at the cost of decreased noise tolerance, our protocol is backwards compatible with prior work, so users may easily switch to the old (normally less efficient) protocol if the noise level is high enough to justify it. To prove security, we show an interesting reduction from the mediated semi-quantum scenario to a fully-quantum entanglement based protocol which may be useful when proving the security of other multi-user quantum key distribution protocols.</jats:p>

<jats:title>Abstract</jats:title> <jats:p>Molecular docking is an important step of the drug discovery process which aims at calculating the preferred position and shape of one molecule to a second when they are bound to each other. During such analysis, 3D representations of molecules are manipulated according to their degree of freedoms: rigid roto-translation and fragment rotations along the rotatable bonds. In our work, we focussed on one specific phase of the molecular docking procedure i.e. <jats:italic>molecular unfolding (MU)</jats:italic>, which is used to remove the initial bias of a molecule by expanding it to an unfolded shape simpler to manipulate within the target cavity. The objective of the MU problem is to find the configuration that maximizes the molecular area, or equivalently, that maximizes the internal distances between atoms inside the molecule. We propose a quantum annealing approach to MU by formulating it as a high-order unconstrained binary optimization which was possible to solve on the latest D-wave annealing hardware (2000Q and advantage). Results and performances obtained with quantum annealers are compared with state of art classical solvers.</jats:p>

<jats:title>Abstract</jats:title> <jats:p>Most security proofs of quantum key distribution (QKD) disregard the effect of information leakage from the users’ devices, and, thus, do not protect against Trojan-horse attacks (THAs). In a THA, the eavesdropper injects strong light into the QKD apparatuses, and then analyzes the back-reflected light to learn information about their internal setting choices. Only a few recent works consider this security threat, but predict a rather poor performance of QKD unless the devices are strongly isolated from the channel. Here, we derive finite-key security bounds for decoy-state-based QKD schemes in the presence of THAs, which significantly outperform previous analyses. Our results constitute an important step forward to closing the existing gap between theory and practice in QKD.</jats:p>

<jats:title>Abstract</jats:title> <jats:p>Bayesian estimation approaches, which are capable of combining the information of experimental data from different likelihood functions to achieve high precisions, have been widely used in phase estimation via introducing a controllable auxiliary phase. Here, we present a Bayesian phase estimation (BPE) algorithm with an ingenious update rule of the auxiliary phase designed via entropy-based sampling. Unlike other adaptive BPE algorithms, the auxiliary phase in our algorithm is determined only once in a pre-estimation step. With simple statistical analysis on a small batch of data, an iteration rule for the auxiliary phase is pre-established and used in all afterward updates, instead of complex calculations in every update trails. During this pre-estimation process the most informative data can be selected, which guides one to perform the BPE with much less measurement times. As the measurement times for the same amount of Bayesian updates is significantly reduced, our algorithm via entropy-based sampling can work as efficient as other adaptive BPE algorithms and shares the advantages (such as wide dynamic range and perfect noise robustness) of non-adaptive BPE algorithms. Our algorithm is of promising applications in various practical quantum sensors such as atomic clocks and quantum magnetometers.</jats:p>

<jats:title>Abstract</jats:title> <jats:p>We introduce NetQASM, a low-level instruction set architecture for quantum internet applications. NetQASM is a universal, platform-independent and extendable instruction set with support for local quantum gates, powerful classical logic and quantum networking operations for remote entanglement generation. Furthermore, NetQASM allows for close integration of classical logic and communication at the application layer with quantum operations at the physical layer. This enables quantum network applications to be programmed in high-level platform-independent software, which is not possible using any other QASM variants. We implement NetQASM in a series of tools to write, parse, encode and run NetQASM code, which are available online. Our tools include a higher-level software development kit (SDK) in Python, which allows an easy way of programming applications for a quantum internet. Our SDK can be used at home by making use of our existing quantum simulators, NetSquid and SimulaQron, and will also provide a public interface to hardware released on a future iteration of Quantum Network Explorer.</jats:p>

<jats:title>Abstract</jats:title> <jats:p>Ensemble-based quantum memories are key to developing multiplexed quantum repeaters, able to overcome the intrinsic rate limitation imposed by finite communication times over long distances. Rare-earth ion doped crystals are main candidates for highly multimode quantum memories, where time, frequency and spatial multiplexing can be exploited to store multiple modes. In this context the atomic frequency comb (AFC) quantum memory provides large temporal multimode capacity, which can readily be combined with multiplexing in frequency and space. In this article, we derive theoretical formulas for quantifying the temporal multimode capacity of AFC-based memories, for both optical memories with fixed storage time and spin-wave memories with longer storage times and on-demand read out. The temporal multimode capacity is expressed in key memory parameters, such as AFC bandwidth, fixed-delay storage time, memory efficiency, and control field Rabi frequency. Current experiments in europium- and praseodymium-doped Y<jats:sub>2</jats:sub>SiO<jats:sub>5</jats:sub> are analyzed within this theoretical framework, which is also tested with newly acquired data, as prospects for higher temporal capacity in these materials are considered. In addition we consider the possibility of spectral and spatial multiplexing to further increase the mode capacity, with examples given for praseodymium doped Y<jats:sub>2</jats:sub>SiO<jats:sub>5</jats:sub>.</jats:p>