LMLuka Music

Luka Music

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

Luka Music has a total of 33 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Verification of Quantum Computations Without Trusted Preparations or Measurements

    by Elham Kashefi, Dominik Leichtle, Luka Music, Harold Ollivier

  • Multi-Party Quantum Cryptography : from Folklore to Real-World

    by Luka Music

    Cryptographie quantique multi-partite : du folklore au monde réel: La cryptographie quantique a bénéficié des nombreuses avancées de la cryptographie et théorie des réseaux classiques. Cependant, elle n’en est qu’à ses balbutiement en ce qui concerne son application en condition réelles et approfondir la théorie sous-jacente est un prérequis crucial à l’exploitation de l’intégralité de ses possibilités. Pour cela, il faut tout d’abord formaliser rigoureusement les propriétés de sécurité quantiques des techniques importées de la cryptographie classique, pour l’instant souvent utilisées sans justification. Ensuite, les progrès récents des technologies quantiques tendent à pointer vers un modèle d’accès type client-serveur avec un client faiblement quantique. Dans ce contexte, les protocoles quantiques se doivent d’être les plus frugaux possibles en termes de ressources (mémoire et opération). Enfin, implémenter des protocoles sur des architectures concrètes nécessite de les adapter finement aux machines utilisées afin d’améliorer encore leur optimisation. Cette thèse contribue à ces trois aspects en : (i) proposant une définition du Quantum Cut-and-Choose, technique qui permet de garantir la préparation honnête d’un message quantique ; (ii) présentant un cadre de sécurité plus réaliste contre les attaques par superposition, qui garantit la sécurité de protocoles classiques exécutés sur une machine quantique ; (iii) construisant un protocole efficace de délégation de calcul multipartite quantique, qui permet à des clients de déléguer un calcul privé à un serveur ; (iv) démontrant qu’il est possible de vérifier l’exactitude de calculs quantiques délégués sans aucun impact en terme ressources côté client ou serveur.

  • Open Access

    Minimizing Resource Overhead in Fusion-Based Quantum Computation Using Hybrid Spin-Photon Devices

    by Stephen C. Wein, Timothée Goubault de Brugière, Luka Music, Pascale Senellart, Boris Bourdoncle, Shane Mansfield

    We present three schemes for constructing a (2,2)-Shor-encoded 6-ring photonic resource state for fusion-based quantum computing, each relying on a different type of photon source. We benchmark these architectures by analyzing their ability to achieve the loss tolerance threshold for fusion-based quantum computation using the target resource state. More precisely, we estimate their minimum hardware requirements for fault-tolerant quantum computation in terms of the number of photon sources to achieve on-demand generation of resource states with a desired generation period. Notably, we find that a group of 12 deterministic single-photon sources containing a single matter qubit degree of freedom can produce the target resource state near-deterministically by exploiting entangling gates that are repeated until success. The approach is fully modular, eliminates the need for lossy large-scale multiplexing, and reduces the overhead for resource-state generation by several orders of magnitude compared to architectures using heralded single-photon sources and probabilistic linear-optical entangling gates. Our work shows that the use of deterministic single-photon sources embedding a qubit substantially shortens the path toward fault-tolerant photonic quantum computation.


  • Top Cited Papers
    Open Access

    An operating system for executing applications on quantum network nodes

    by C. Delle Donne, M. Iuliano, B. van der Vecht, G. M. Ferreira, H. Jirovská, T. J. W. van der Steenhoven, A. Dahlberg, M. Skrzypczyk, D. Fioretto, M. Teller, et al.

    The goal of future quantum networks is to enable new internet applications that are impossible to achieve using only classical communication1,2,3. Up to now, demonstrations of quantum network applications4,5,6 and functionalities7,8,9,10,11,12 on quantum processors have been performed in ad hoc software that was specific to the experimental setup, programmed to perform one single task (the application experiment) directly into low-level control devices using expertise in experimental physics. Here we report on the design and implementation of an architecture capable of executing quantum network applications on quantum processors in platform-independent high-level software. We demonstrate the capability of the architecture to execute applications in high-level software by implementing it as a quantum network operating system—QNodeOS—and executing test programs, including a delegated computation from a client to a server13 on two quantum network nodes based on nitrogen-vacancy (NV) centres in diamond14,15. We show how our architecture allows us to maximize the use of quantum network hardware by multitasking different applications. Our architecture can be used to execute programs on any quantum processor platform corresponding to our system model, which we illustrate by demonstrating an extra driver for QNodeOS for a trapped-ion quantum network node based on a single 40Ca+ atom16. Our architecture lays the groundwork for computer science research in quantum network programming and paves the way for the development of software that can bring quantum network technology to society.


  • Asymmetric secure multi-party quantum computation with weak clients against dishonest majority

    by Theodoros Kapourniotis, Elham Kashefi, Dominik Leichtle, Luka Music, Harold Ollivier

    Secure multi-party computation (SMPC) protocols allow several parties distrusting each other to collectively compute a function on their inputs, without revealing the input values. In this paper, we introduce a protocol that lifts SMPC to its quantum counterpart—secure multi-party quantum computation (SMPQC) for classical inputs and outputs—in a composable and statistically secure way, even for a single honest party. The soundness error—the maximum cheating probability of malicious parties—is shown to be proportional to the inverse of a polynomial with respect to the number of rounds in the protocol, and can be further decreased to a negligible quantity for bounded-error quantum-polynomial-time computations. Unlike previous SMPQC protocols, our proposal only requires very limited quantum resources from all but one party. In addition, the protocol exhibits some noise robustness that can facilitate small-scale implementations with near-future technologies. The protocol is based on a new technique for quantum verification that requires only the collective remote preparation of quantum states in a single plane of the Bloch sphere. To demonstrate the ability of verifying the computation with such limited clients, we uncover and use a fundamental invariance that is inherent to measurement-based quantum computing.


  • Unifying quantum verification and error-detection: theory and tools for optimisations

    by Theodoros Kapourniotis, Elham Kashefi, Dominik Leichtle, Luka Music, Harold Ollivier

    With the advent of cloud-based quantum computing, it has become vital to provide strong guarantees that computations delegated by clients to quantum service providers have been executed faithfully. Secure—blind and verifiable—delegated quantum computing (SDQC) has emerged as one of the key approaches to address this challenge, yet current protocols lack at least one of the following three ingredients: composability, noise-robustness and modularity. To tackle this question, our paper lays out the fundamental structure of SDQC protocols, namely mixing two components: the computation which the client would like the server to perform and tests that are designed to detect a server’s malicious behaviour. Using this abstraction, our main technical result is a set of sufficient conditions on these components which imply the security and noise-robustness of generic SDQC protocols in the composable Abstract Cryptography framework. This is done by establishing a correspondence between these security properties and the error-detection capabilities of the test computations. Changing the types of tests and how they are mixed with the client’s computation automatically yields new SDQC protocols with different security and noise-robustness capabilities. This approach thereby provides the desired modularity as our sufficient conditions on test computations simplify the steps required to prove the security of the protocols and allows to focus on the design and optimisation of test rounds to specific situations. We showcase this by systematising the search for improved SDQC protocols for bounded-error quantum polynomial-time ( BQP ) computations. The resulting protocols do not require more hardware on the server’s side than what is necessary to blindly delegate the computation without verification, and they outperform all previously known results.