PulseAugur
EN
LIVE 17:15:44
한국어(KO) PSI가 비공개 Anthropic 모델을 활용한 연구 시스템으로 2008년 제기된 양자 계산 복잡도 추측의 증명을 찾았다고 발표했다. 시스템은 실행 사흘째 첫 증명을 도출했으며, 개선된 증명도 Lean으로 검증됐다. 결과는 무작위 입력의 예·아니오 문제에서 양자컴퓨터의 입력 조회 횟수가

PSI finds quantum computing proof using private Anthropic model

By PulseAugur Editorial · [1 sources] ·

PSI has announced a breakthrough in quantum computing complexity, finding a proof for a conjecture posed in 2008. The research system, which utilized a private Anthropic model, generated its first proof within three days of operation. Further verification of the proof was conducted using Lean, and the results indicate that quantum computers cannot exponentially reduce the number of input lookups for certain yes/no problems compared to classical computers. AI

IMPACT This research could advance theoretical understanding of quantum computing's capabilities, potentially influencing future hardware and algorithm development.

RANK_REASON The cluster reports on a research finding and proof verification, fitting the research bucket. [lever_c_demoted from research: ic=1 ai=1.0]

Read on Mastodon — sigmoid.social →

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

PSI finds quantum computing proof using private Anthropic model

How we ranked this

Signal score
11 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Tool
The cluster reports on a research finding and proof verification, fitting the research bucket. [lever_c_demoted from research: ic=1 ai=1.0]
Source corroboration
Single-source cluster
Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics
paper, model release
Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance
High
Clearly on-topic for AI-industry coverage.
Story freshness
Breaking (< 6h)
Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

Full methodology in our editorial standards.

COVERAGE [1]

  1. Mastodon — sigmoid.social TIER_1 한국어(KO) · [email protected] ·

    PSI announced that its research system, utilizing a private Anthropic model, has found a proof for a quantum computational complexity conjecture proposed in 2008. The system derived its first proof on the third day of operation, and an improved proof was verified in Lean. The results concern the number of input lookups by a quantum computer in the yes/no problem for random inputs.

    PSI가 비공개 Anthropic 모델을 활용한 연구 시스템으로 2008년 제기된 양자 계산 복잡도 추측의 증명을 찾았다고 발표했다. 시스템은 실행 사흘째 첫 증명을 도출했으며, 개선된 증명도 Lean으로 검증됐다. 결과는 무작위 입력의 예·아니오 문제에서 양자컴퓨터의 입력 조회 횟수가 고전 컴퓨터보다 기하급수적으로 적을 수 없다는 뜻이다. 증명은 공개됐지만 발견에 사용된 모델은 비공개이며, 외부 연구자들의 검토가 진행 중이다. https:// psi.inc/research/aaronson-amb…

    LINKS psi.inc/…/aaronson-ambainis

RELATED ENTITIES

RELATED TOPICS