Related papers: Examples of the Generalized Quantum Permanent Comp…
We consider the security of continuous-variable quantum key distribution using thermal (or noisy) Gaussian resource states. Specifically, we analyze this against collective Gaussian attacks using direct and reverse reconciliation where both…
We propose Bell inequalities for discrete or continuous quantum systems which test the compatibility of quantum physics with an interpretation in terms of deterministic hidden-variable theories. The wave function collapse that occurs in a…
Rapid progress in generative AI has given rise to Compound AI systems - pipelines comprised of multiple large language models (LLM), software tools and database systems. Compound AI systems are constructed on a layered traditional software…
Quantum Key Distribution allows two parties to establish a secret key that is secure against computationally unbounded adversaries. To extend the distance between parties, quantum networks, and in particular repeater chains, are vital.…
Destructive quantum interference in molecular junctions might be used to build molecular quantum rulers, allowing to quantify changes in external control parameters electrically. For this reason, it is important to understand which patterns…
The development of automated gate specification for quantum communications and quantum networked computation opens up the way for malware designed at corrupting the automation software, changing the automated quantum communications…
Physical implementations of cryptographic algorithms leak information, which makes them vulnerable to so-called side-channel attacks. The problem of secure computation in the presence of leakage is generally known as leakage resilience. In…
In this article, we construct some examples of noncommutative projective Calabi-Yau schemes by using noncommutative Segre products and quantum weighted hypersurfaces. We also compare them with commutative Calabi-Yau varieties and examples…
Some multipartite quantum states can be generated in a sequential manner which may be implemented by various physical setups like microwave and optical cavity QED, trapped ions, and quantum dots etc. We analyze the general N to M qubits…
Microclusters are the basic building blocks used to construct cluster states capable of supporting fault-tolerant quantum computation. In this paper, we explore the consequences of errors on microcluster construction using two error models.…
In a post-quantum world, where attackers may have access to full-scale quantum computers, all classical password-based authentication schemes will be compromised. Quantum copy-protection prevents adversaries from making copies of existing…
Quantum random access memory (QRAM) is required for numerous quantum algorithms and network architectures. Previous work has shown that the ubiquitous bucket-brigade QRAM is highly resilient to arbitrary local incoherent noise channels…
Qubit loss and gate failure are significant problems for the development of scalable quantum computing. Recently various schemes have been proposed for tolerating qubit loss and gate failure. These include schemes based on cluster and…
Studying adversarial robustness of quantum machine learning (QML) models is essential in order to understand their potential advantages over classical models and build trustworthy systems. Distributing QML models allows leveraging multiple…
Harnessing quantum processes is an efficient method to generate truly indeterministic random numbers, which are of fundamental importance for cryptographic protocols, security applications or Monte-Carlo simulations. Recently, quantum…
The rapid growth of interest in quantum computing has brought about the need to secure these powerful machines against a range of physical attacks. As qubit counts increase and quantum computers achieve higher levels of fidelity, their…
We identify and study a new security loophole in continuous-variable quantum key distribution (CV-QKD) implementations, related to the imperfect linearity of the homodyne detector. By exploiting this loophole, we propose an active…
An adversary copies your encrypted traffic today and waits for a quantum computer to decrypt it later. How exposed are you? We show that the functional form of the answer is not merely a calibration choice -- it is structurally justified by…
Current adversarial attack research reveals the vulnerability of learning-based classifiers against carefully crafted perturbations. However, most existing attack methods have inherent limitations in cross-dataset generalization as they…
Quantum computing has the potential to provide solutions to problems that are intractable on classical computers, but the accuracy of the current generation of quantum computers suffer from the impact of noise or errors such as leakage,…