ARAlena Romanova

Alena Romanova

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Alena Romanova has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Blind quantum computing with different qudit resource state architectures

    by Alena Romanova, Wolfgang Dür

    We discuss how blind quantum computing generalizes to multilevel quantum systems (qudits), which offers advantages compared with the qubit approach. Here, a quantum computing task is delegated to an untrusted server while simultaneously preventing the server from retrieving information about the computation it performs, the input, and the output, enabling secure cloud-based quantum computing. In the standard approach with qubits, measurement-based quantum computing is used: single-qubit measurements on cluster or brickwork states implement the computation, while random rotations of the resource qubits hide the computation from the server. We generalize finite-sized approximately universal gate sets to prime-power-dimensional qudits and show that qudit versions of the cluster and brickwork states enable a similar server-blind execution of quantum algorithms. Furthermore, we compare the overheads of different resource state architectures and discuss which hiding strategies apply to alternative qudit resource states beyond graph states.


  • Open Access

    Measurement-based quantum computing with qudit stabilizer states

    by Alena Romanova, Wolfgang Dür

    We show how to perform measurement-based quantum computing on qudits (high-dimensional quantum systems) using alternative resource states beyond the cluster state. Estimating overheads for gate decomposition, we find that generalizing standard qubit measurement patterns to the qudit cluster state is suboptimal in most dimensions, so that alternative qudit resource states could enable enhanced computational efficiency. In these resources, the entangling interaction is a block-diagonal Clifford operation rather than the usual controlled-phase gate for cluster states. This simple change has remarkable consequences: the applied entangling operation determines an intrinsic single-qudit gate associated with the resource that drives the quantum computation when performing single-qudit measurements on the resource state. We prove a condition for the intrinsic gate allowing for the measurement-based implementation of arbitrary single-qudit unitaries. Furthermore, we demonstrate for prime-power-dimensional qudits that the complexity of the realization depends linearly both on the dimension and the Pauli order of the intrinsic gate. These insights also allow us to optimize the efficiency of the standard qudit cluster state by effectively mimicking more favorable intrinsic-gate structures, thereby reducing the required measurement depth. Finally, we discuss the required two-dimensional geometry of the resource state for universal measurement-based quantum computing. As concrete examples, we present multiple alternative resource states. In certain dimensions, we show the existence of resource states achieving optimal intrinsic gates, enabling more efficient measurement-based quantum information processing than the qudit cluster state and highlighting the potential of qudit stabilizer state resources for future quantum computing architectures.


  • Open Access

    Memory-corrected quantum repeaters with adaptive syndrome identification

    by Alena Romanova, Peter van Loock

    We address the challenge of incorporating encoded quantum memories into an exact secret key rate analysis for small and intermediate-scale quantum repeaters. To this end, we introduce the check matrix model and quantify the resilience of stabilizer codes of up to eleven qubits against Pauli noise, obtaining analytical expressions for effective logical error probabilities. Generally, we find that the five-qubit and Steane codes either outperform more complex, larger codes in the experimentally relevant parameter regimes or have a lower resource overhead. Subsequently, we apply our results to calculate lower bounds on the asymptotic secret key rate in memory-corrected quantum repeaters when using the five-qubit or Steane codes on the memory qubits. The five-qubit code drastically increases the effective memory coherence time, reducing a phase flip probability of 1 % to 0.001 % when employing an error syndrome identification adapted to the quantum noise channel. Furthermore, it mitigates the impact of faulty Bell state measurements and imperfect state preparation, lowering the minimally required depolarization parameter for nonzero secret key rates in an eight-segment repeater from 98.4 % to 96.4 % . As a result, the memory-corrected quantum repeater can often generate secret keys in experimental parameter regimes where the unencoded repeater fails to produce a secret key. In an eight-segment repeater, one can even achieve nonvanishing secret key rates up to distances of 2000 km for memory coherence times of t c = 10 s or less using multiplexing. Assuming a zero-distance link-coupling efficiency p 0 = 0.7 , a depolarization parameter μ = 0.99 , t c = 10 s, and an 800 km total repeater length, we obtain a secret key rate of 4.85 Hz, beating both the unencoded repeater that provides 1.25 Hz and ideal twin-field quantum key distribution with 0.71 Hz at GHz clock rates.


  • Machine-learning-based detection of spin structures

    by Isaac Labrie-Boulay, Thomas Brian Winkler, Daniel Franzen, Alena Romanova, Hans Fangohr, Mathias Kläui

    One of the most important magnetic spin structures is the topologically stabilized skyrmion quasiparticle. Its interesting physical properties make it a candidate for memory and efficient neuromorphic computation schemes. For device operation, the detection of the position, shape, and size of skyrmions is required and magnetic imaging is typically employed. A frequently used technique is magneto-optical Kerr microscopy, in which, depending on the sample’s material composition, temperature, material growing procedures, etc., the measurements suffer from noise, low contrast, intensity gradients, or other optical artifacts. Conventional image analysis packages require manual treatment, and a more automatic solution is required. We report a convolutional neural network specifically designed for segmentation problems to detect the position and shape of skyrmions in our measurements. The network is tuned using selected techniques to optimize predictions and, in particular, the number of detected classes is found to govern the performance. The results of this study show that a well-trained network is a viable method of automating data preprocessing in magnetic microscopy. The approach is easily extendable to other spin structures and other magnetic imaging methods.


  • Open Access

    Giant Rydberg excitons in Cu2O probed by photoluminescence excitation spectroscopy

    by Marijn A. M. Versteegh, Stephan Steinhauer, Josip Bajo, Thomas Lettner, Ariadna Soro, Alena Romanova, Samuel Gyger, Lucas Schweickert, André Mysyrowicz, Val Zwiller

    Rydberg excitons are, with their ultrastrong mutual interactions, giant optical nonlinearities, and very high sensitivity to external fields, promising for applications in quantum sensing and nonlinear optics at the single-photon level. To design quantum applications it is necessary to know how Rydberg excitons and other excited states relax to lower-lying exciton states. Here, we present photoluminescence excitation spectroscopy as a method to probe transition probabilities from various excitonic states in cuprous oxide. We show giant Rydberg excitons at T=38 mK with principal quantum numbers up to n=30, corresponding to a calculated diameter of 3μm.