ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Entanglement generation”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

quant-phcs.ETcs.NIEmpiricalRecentJul 22, 2026

Distributed Entanglement Distribution Using Multiple Entanglement Sources in WDM-based Quantum Optical Networks

Anuj Agrawal, Abhay Singh Dulta, Bhaskar Kanseri

This paper proposes a wavelength division multiplexing (WDM)-based entanglement distribution approach using multiple spontaneous parametric downconversion (SPDC) broadband entangled photon pair source…

View →
cs.ITquant-phTheoreticalRecentJul 15, 2026

Precoding-based protocols for entanglement assisted linear computation over a quantum many-to-one network

Ruoyu Meng, Aditya Ramamoorthy

This paper presents protocols for computing a linear combination over a noiseless quantum many-to-one network with more general linear transformations and lower communication cost.

View →
quant-phcs.AIcs.LGTheoreticalRecentAug 5, 2026

Representational separation between unitary and channel quantum generative models via shared classical randomness at shallow depth

Arunava Majumder, Marius Krumm, Hendrik Poulsen Nautrup, Hans J. Briegel

The paper introduces a method using shared classical randomness to establish a strict representational separation over a shallow unitary Born model for quantum generative models, allowing for the gene…

View →
quant-phcs.CRMar 27, 2026

Information-Theoretic Solutions for Seedless QRNG Bootstrapping and Hybrid PQC-QKD Key Combination

Juan Antonio Vieira Giestinhas, Timothy Spiller

The paper proposes a unified, information-theoretic framework using universal hash functions to solve the bootstrapping of seedless QRNGs and to securely combine PQC and QKD keys against quantum adver…

View →
quant-phcond-mat.dis-nncs.CCTheoreticalRecentJul 15, 2026

Circuit complexity lower bounds for quantum spin glasses

Omar Al-Ghattas, David Gamarnik

This paper shows that shallow circuits cannot prepare near-optimal states for random quantum $p$-spin glasses, and proves depth lower bounds for such preparations.

View →
quant-phcs.DCcs.ETTheoreticalRecentJul 20, 2026

Entanglement geometry separates circuit cutting, classical hardness, and trainability

Maria Gragera Garces, Sabina Drăgoi, Lirandë Pira

This paper explores the constraints of achieving quantum advantage in circuit cutting while maintaining low overhead, classical hardness, and trainability, and introduces a two-block circuit family th…

View →
quant-phcs.CRphysics.opticsApr 1, 2026

Engineering a Phase-Noise-Based Quantum Random Number Generator for Real-Time Secure Applications: Design, Validation, and Scalability

Anurag K. S. V., Shubham Chouhan, K. Srinivasan, G. Raghavan +1 more

The paper presents a high-speed, phase-noise-based Quantum Random Number Generator (QRNG) that achieves a post-processed generation rate of 1.0 Gbps, suitable for real-time secure applications.

View →
math-phcs.ITquant-phTheoreticalRecentJun 16, 2026

Average entropy of Bogoliubov-Kubo-Mori random state ensemble

Sohail, Lu Wei

This paper derives an exact formula for average entanglement entropy over the Bogoliubov-Kubo-Mori ensemble.

View →
quant-phcs.CCTheoreticalRecentOct 29, 2026

Clifford synthesis is NP-complete

Søren Fuglede Jørgensen

The paper proves that synthesizing a quantum circuit for a given Clifford operator using a specified amount of resources is NP-complete for several resource models.

View →
cs.DMcs.ITTheoreticalRecentJun 11, 2026

Entropic Generation of Binary Words

Olivier Bodini, Francis Durand

This paper introduces a novel algorithm for generating k Hamming weight binary words in linear time while minimizing random bit consumption.

View →
quant-phcs.CRRecentMay 29, 2026

Pseudoentanglement in constant depth: How trivial states can have non-trivial entanglement structure

Alexandru Gheorghiu

The paper constructs a family of simple quantum states (pseudoentangled states) generated by constant-depth circuits that exhibit non-trivial entanglement structure, demonstrating that entanglement st…

View →
quant-phcs.CCcs.CRTheoreticalRecentOct 16, 2026

Concrete Functions in Private Simultaneous Quantum Messages: Quantum Advantages and Structural Limitations

Harumichi Nishimura

This paper investigates the communication complexity of private simultaneous quantum messages for various functions.

View →
quant-phcs.AReess.SYEmpiricalRecentOct 2, 2026

Compiling Together: High-Throughput Distributed Quantum Computing via Multi-Compilation

Yipei Liu, Sen Zhang, Zebo Yang, Lei Yang

This paper improves the efficiency of distributed quantum computing by concurrently executing multiple compilations of the same quantum circuit.

View →
quant-phcs.DSTheoreticalRecentJun 29, 2026

Working with measurement-based computations on qudits

Piotr Mitosek, Miriam Backens

This paper simplifies the definition of qudit flow, a model of quantum computation, and improves its complexity to match qubit flows.

View →
quant-phcs.AIRecentMay 31, 2026

Quantum Algorithm for Distributed Reduction of Entanglements (QADR): A Trainable and Simulation-Efficient QML Framework

Syed Farhan Ahmad, Gregory T. Byrd

The paper introduces QADR, a novel hybrid quantum-classical framework that efficiently trains variational quantum circuits by localizing entanglement reduction, thereby overcoming the exponential memo…

View →