Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1904.06411 · Science China Physics Mechanics and Astronomy

The quantum cocktail party problem

Xiao Liang, YaDong Wu, Hui Zhai

Published Feb 21, 2020• 3 citations
arXivHTMLPDF
DOI
10.1007/s11433-019-1493-7

Related papers

Modified independent component analysis for extracting Eigen-Modes of a quantum system

Yadong Wu, Hui Zhai

Abstract Dynamical probes are popular experimental tools for studying quantum systems nowadays. Though a well-defined eigen-mode will manifest itself as a single frequency oscillation in the dynamical probe, the real experimental data can be quite messy because a probe usually excites multiple modes which are also mixed together with random white noise. Moreover, the oscillations usually quickly damp out due to finite decoherence time. These make it difficult to extract the frequencies of these oscillation measurement data, that is, the eigen-energies of these eigen-modes. Here we develop an unsupervised machine learning algorithm to solve this problem. Our method is inspired by the independent component analysis method and its application to the ‘cocktail party problem’, where the goal is to recover each voice from detectors that detect signals of many mixed voices. We demonstrate the advantage of our method by an example of analyzing the collective mode of a Bose–Einstein condensate of atomic gases. We believe that this method can find broad applications in analyzing data of dynamical experiments in quantum systems of different fields.

arXiv:1904.05067•Machine Learning Science and Technology•Apr 3, 2020•2 citations

The quantum puzzle

Stephen W. McKnight, Christos Zahopoulos

Cambridge University Press eBooks•Aug 10, 2015•0 citations

The Quantum Engineering Conundrum

Christopher R. Monroe

Bulletin of the American Physical Society•Jun 7, 2017•0 citations

Photonics: Cocktail colours

Felix Cheung

Nature China•Mar 4, 2009•0 citations

Loopholes

David Wick

In 1985, David Mermin, a solid-state physicist at Cornell, wrote a funny and informative account of the EPR argument and Bell’s theorem for Physics Today, the Wall Street Journal of the American physics community. Mermin’s article generated a resurgence of interest in the subject, which swept like a cresting wave through the cocktail-party circuit and just as quickly receded. I recall confused discussions from this period with members of my generation, who alternately declared Bell’s theorem trivial, uninteresting, or the greatest discovery since Einstein proved moving clocks go slowly. One sentiment produced universal agreement, however: Do not write papers or apply for grants in the area, since “philosophical” issues are career killers.

Birkhäuser Boston eBooks•Jan 1, 1995•0 citations

Strongly Regular Graph Construction via Quadratic Binary Optimization

D. Osorio, P. Andagana, V. González +2 more

Strongly regular graphs, hereafter SRGs, are highly structured combinatorial objects of central interest in algebraic graph theory and quantum information, whose explicit construction becomes rapidly intractable as the number of vertices grows; Conway's still unresolved $99$-graph problem is an emblematic example. The matrix equation defining SRGs is quadratic in the binary edge variables, so the natural penalty enforcing it, a sum of squared residuals, is quartic and lies outside quadratic unconstrained binary optimization, known as QUBO. We prove a considerably stronger obstruction, namely that no quadratic function of the edge variables has the labeled SRGs as its exact set of global minimizers, except for three degenerate families given by the perfect matchings, the cocktail-party graphs and the pentagon. In particular, we formally establish that the $99$-vertex graph of Conway's problem cannot be obtained from any QUBO over the edge variables without auxiliary variables. Guided by this theorem we develop two complementary algorithms. The first operates within pure QUBO, solves the degenerate families exactly, and beyond them works as a generate--prune--verify pipeline whose output is a reduced set of candidates certified by a polynomial-time classical test. The second solves the full problem by quadratizing this quartic penalty through Rosenberg auxiliary variables, whose number grows as $Θ(N^3)$ with the number of vertices $N$. We test the pure-QUBO route under simulated annealing on all feasible families with at most $18$ vertices and the auxiliary-variable route on representative targets up to $16$ vertices, and tabulate the algebraically feasible parameter sets for graphs with at most $49$ vertices.

math.OCCross-listedarXiv:2610.30142•Aug 3, 2026•0 citations
Abstract Dynamical probes are popular experimental tools for studying quantum systems nowadays. Though a well-defined eigen-mode will manifest itself as a single frequency oscillation in the dynamical probe, the real experimental data can be quite messy because a probe usually excites multiple modes which are also mixed together with random white noise. Moreover, the oscillations usually quickly damp out due to finite decoherence time. These make it difficult to extract the frequencies of these oscillation measurement data, that is, the eigen-energies of these eigen-modes. Here we develop an unsupervised machine learning algorithm to solve this problem. Our method is inspired by the independent component analysis method and its application to the ‘cocktail party problem’, where the goal is to recover each voice from detectors that detect signals of many mixed voices. We demonstrate the advantage of our method by an example of analyzing the collective mode of a Bose–Einstein condensate of atomic gases. We believe that this method can find broad applications in analyzing data of dynamical experiments in quantum systems of different fields.
In 1985, David Mermin, a solid-state physicist at Cornell, wrote a funny and informative account of the EPR argument and Bell’s theorem for Physics Today, the Wall Street Journal of the American physics community. Mermin’s article generated a resurgence of interest in the subject, which swept like a cresting wave through the cocktail-party circuit and just as quickly receded. I recall confused discussions from this period with members of my generation, who alternately declared Bell’s theorem trivial, uninteresting, or the greatest discovery since Einstein proved moving clocks go slowly. One sentiment produced universal agreement, however: Do not write papers or apply for grants in the area, since “philosophical” issues are career killers.
Strongly regular graphs, hereafter SRGs, are highly structured combinatorial objects of central interest in algebraic graph theory and quantum information, whose explicit construction becomes rapidly intractable as the number of vertices grows; Conway's still unresolved 999999-graph problem is an emblematic example. The matrix equation defining SRGs is quadratic in the binary edge variables, so the natural penalty enforcing it, a sum of squared residuals, is quartic and lies outside quadratic unconstrained binary optimization, known as QUBO. We prove a considerably stronger obstruction, namely that no quadratic function of the edge variables has the labeled SRGs as its exact set of global minimizers, except for three degenerate families given by the perfect matchings, the cocktail-party graphs and the pentagon. In particular, we formally establish that the 999999-vertex graph of Conway's problem cannot be obtained from any QUBO over the edge variables without auxiliary variables. Guided by this theorem we develop two complementary algorithms. The first operates within pure QUBO, solves the degenerate families exactly, and beyond them works as a generate--prune--verify pipeline whose output is a reduced set of candidates certified by a polynomial-time classical test. The second solves the full problem by quadratizing this quartic penalty through Rosenberg auxiliary variables, whose number grows as Θ(N3)Θ(N^3)Θ(N3) with the number of vertices NNN. We test the pure-QUBO route under simulated annealing on all feasible families with at most 181818 vertices and the auxiliary-variable route on representative targets up to 161616 vertices, and tabulate the algebraically feasible parameter sets for graphs with at most 494949 vertices.